On Binomial Transform of the Generalized Fifth Order Pell Sequence

In this paper, we define the binomial transform of the generalized fifth order Pell sequence and as special cases, the binomial transform of the fifth order Pell and fifth order Pell-Lucas sequences will be introduced. We investigate their properties in details. We present Binet’s formulas, generating functions, Simson formulas, recurrence properties, and the summation formulas for these binomial transforms. Moreover, we give some identities and matrices related with these binomial transforms.

Markoff–Rosenberger triples and generalized Lucas sequences

We consider the Markoff–Rosenberger equation $$\begin{aligned} ax^2+by^2+cz^2=dxyz \end{aligned}$$ a x 2 + b y 2 + c z 2 = d x y z with $$(x,y,z)=(U_i,U_j,U_k)$$ ( x , y , z ) = ( U i , U j , U k ) , where $$U_i$$ U i denotes the i-th generalized Lucas number of first/second kind. We provide an upper bound for the minimum of the indices and we apply the result to completely resolve concrete equations, e.g. we determine solutions containing only balancing numbers and Jacobsthal numbers, respectively.

On Generalized p-Mersenne Numbers

In this paper, we introduce the generalized p-Mersenne sequence and deal with, in detail, two special cases, namely, p-Mersenne and p-Mersenne-Lucas-sequences. We present Binet’s formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences.

Some arithmetic functions of factorials in Lucas sequences

We prove that if {un}n≥ 0 is a nondegenerate Lucas sequence, then there are only finitely many effectively computable positive integers n such that |un|=f(m!), where f is either the sum-of-divisors function, or the sum-of-proper-divisors function, or the Euler phi function. We also give a theorem that holds for a more general class of integer sequences and illustrate our results through a few specific examples. This paper is motivated by a previous work of Iannucci and Luca who addressed the above problem with Catalan numbers and the sum-of-proper-divisors function.

SOLUTIONS TO A LEBESGUE–NAGELL EQUATION

We find all integer solutions to the equation $x^2+5^a\cdot 13^b\cdot 17^c=y^n$ with $a,\,b,\,c\geq 0$ , $n\geq 3$ , $x,\,y>0$ and $\gcd (x,\,y)=1$ . Our proof uses a deep result about primitive divisors of Lucas sequences in combination with elementary number theory and computer search.