Let k, t, d be arbitrary integers with k ≥ 2, t ≥ 0 and d = k − k. In the first section we give some preliminaries from Pell equations x − dy = 1 and x − dy = N , where N be any fixed positive integer. In the second section, we consider the integer solutions of Pell equations x − dy = 1 and x − dy = 2. We give a method for the solutions of these equations. Further we derive recurrence relations...

Denote by {Fn} and {Ln} the Fibonacci numbers and Lucas numbers, respectively. Let Fn = Fn × Ln and Ln = Fn + Ln. Denote by {Pn} and {Qn} the Pell numbers and Pell-Lucas numbers, respectively. Let Pn = Pn × Qn and Qn = Pn + Qn. In this paper, we give some determinants and permanent representations of Pn, Qn, Fn and Ln. Also, complex factorization formulas for those numbers are presented. Key–Wo...

In this paper, we define the Fibonacci–Jacobsthal, Padovan–Fibonacci, Pell–Fibonacci, Pell–Jacobsthal, Padovan–Pell and Padovan–Jacobsthal sequences which are directly related with Fibonacci, Jacobsthal, Pell Padovan numbers give their structural properties by matrix methods. Then obtain new relationships between numbers.

with given a, b, t0, t1 and n ≥ 0. This sequence was introduced by Horadam [3] in 1965, and it generalizes many sequences (see [1, 4]). Examples of such sequences are Fibonacci polynomials sequence (Fn(x))n≥0, Lucas polynomials sequence (Ln(x))n≥0, and Pell polynomials sequence (Pn(x))n≥0, when one has a = x, b = t1 = 1, t0 = 0; a = t1 = x, b = 1, t0 = 2; and a = 2x, b = t1 = 1, t0 = 0; respect...

We examine a pair of Rogers-Ramanujan type identities of V. A. Lebesgue, and give polynomial identities for which the original identities are limiting cases. The polynomial identities turn out to be q-analogs of the Pell sequence. Finally, we provide combinatorial interpretations for the identities.

In this paper, we consider the generalized order-k Pell numbers and present an algorithm for computing the sums of the generalized order-k Pell numbers, as well as the Pell numbers themselves. The theoretical basis of using a matrix method for deriving the algorithm is also discussed. 2006 Elsevier Inc. All rights reserved.

In this paper, we derive some identities on Pell, Pell-Lucas, and balancing numbers and the relationships between them. We also deduce some formulas on the sums, divisibility properties, perfect squares, Pythagorean triples involving these numbers. Moreover, we obtain the set of positive integer solutions of some specific Pell equations in terms of the integer sequences mentioned in the text.

We show that the only Pell numbers whose Euler function is also a Pell number are 1 and 2.