相关论文: Lucas sequences whose 12th or 9th term is a square

Let $r\ge 1$ be an integer and ${\bf U}:=\{U_n\}_{n\ge 0}$ be the Lucas sequence given by $U_0=0,~U_1=1$, and $U_{n+2}=rU_{n+1}+U_n$ for $n\ge 0$. In this paper, we explain how to find all the solutions of the Diophantine equation,…

For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all the integers…

In this paper, we discuss about some results on average of Fibonacci and Lucas sequences that may be found in the OEIS code A111035.

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…

We introduce a new four-parameters sequence that simultaneously generalizes some well-known integer sequences, including Fibonacci, Padovan, Jacobsthatl, Pell, and Lucas numbers. Combinatorial interpretations are discussed and many…

A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A square-free permutation of length $n$ is $P$-crucial, where $P$ is a subset of $\{0,1,\ldots,n\}$, if any of its…

A set $A$ of positive integers is said to be Schreier if either $A = \emptyset$ or $\min A\ge |A|$. We give a bijective map to prove the recurrence of the sequence $(|\mathcal{K}_{n, p, q}|)_{n=1}^\infty$ (for fixed $p\ge 1$ and $q\ge 2$),…

We evaluate some types of infinite series with balancing and Lucas-balancing polynomials in closed form. These evaluations will lead to some new curious series for $\pi$ involving Fibonacci and Lucas numbers. Our findings complement those…

In this study, we define the dual Fibonacci quaternion and the dual Lucas quternion. We derive the relations between the dual Fibonacci and the dual Lucas quaternion which connected the Fibonacci and the Lucas numbers. Furthermore, we give…

We show that the $Kn$--smooth part of $a^n-1$ for an integer $a>1$ is $a^{o(n)}$ for most positive integers $n$.

An $(n,k)$-perfect sequence covering array with multiplicity $\lambda$, denoted PSCA$(n,k,\lambda)$, is a multiset whose elements are permutations of the sequence $(1,2, \dots, n)$ and which collectively contain each ordered length $k$…

A number $N$ is a triangular number if it can be written as $N = t(t + 1)/2$ for some nonnegative integer number $t$. A triangular number $N$ is called square if it is a perfect square, that is, $N = d^2$ for some integer number $d$. Square…

Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $n$ and a prime power $q$. Based on Pascal's triangle we give an…

Let $U_n=U_n(P,Q)$ be a nondegenerate Lucas sequence with $Q=\pm 1$ and discriminant $\Delta=P^2+4Q>0$. We study Diophantine equations \[ A y^k=\prod_{i=1}^r U_{n_i}(P,Q), \qquad k\geq 2, \] where the indices $n_1,\ldots,n_r$ are pairwise…

This paper presents a new explicit infinite family of 2-quasi-perfect $p$-ary Lee codes of length $\frac{q-1}{2}$ and dimension $\frac{q-1}{2}-2k$ for $q = p^k \ge 14$, $p\geq 5$ a prime. Our codes are derived from the generating set $H_q =…

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

A cubic (resp. biquadratic) theta series is a power series whose n-th coefficient is equal to 1 if n is a perfect cube (resp. fourth power) and zero otherwise. We improve on a result of Bradshaw by showing that such series is not a cubic…

We give an overview about well-known basic properties of two classes of q-Fibonacci and q-Lucas polynomials and offer a common generalization.

We introduce several new constructions for perfect periodic autocorrelation sequences and arrays over the unit quaternions. This paper uses both mathematical proofs and com- puter experiments to prove the (bounded) array constructions have…

A real-valued sequence $f = \{ f(n) \}_{n \in \mathbb{N}}$ is said to be second-order holonomic if it satisfies a linear recurrence $f (n + 2) = P (n) f (n + 1) + Q (n) f (n)$ for all sufficiently large $n$, where $P, Q \in \mathbb{R}(x)$…