A positive $n$ is called a balancing number if $$1+2+\cdots +(n-1)=(n+1)+(n+2)+\cdots +(n+r).$$ We prove that there is no balancing number which is a term of the Lucas sequence.

We show that the only Lucas numbers which are factoriangular are $1$ and $2$.

Let ${\left(G_n\right)}_{n\ge 1}$ be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are $\left\{U_n\right\}$ and $\left\{V_n\right\}$, respectively. We show that the Diophantine equation $G_n=B·(g^{lm}-1)/(g^l-1)$ has only finitely many solutions in $n,m\in {\mathbb{Z}}^{+}$, where $g\ge 2$, $l$ is even and $1\le B\le g^l-1$. Furthermore, these solutions can be effectively determined by reducing such equation to biquadratic elliptic curves. Then, by a result of Baker (and its best improvement due to Hajdu and Herendi) related to the bounds of the integral points on...

Let ${\left(L_n\right)}_{n\ge 0}$ be the Lucas sequence. We show that the Diophantine equation $L_n-L_m=M_k$ has only the nonnegative integer solutions $(n,m,k)=(2,0,1)$, $(3,1,2)$, $(3,2,1)$, $(4,3,2)$, $(5,3,3)$, $(6,2,4)$, $(6,5,3)$ where $M_k=2^k-1$ is the $k$th Mersenne number and $n>m$.

We consider the Tribonacci sequence $T:={T_n}_{n\ge 0}$ given by T₀ = 0, T₁ = T₂ = 1 and $T_{n+3}=T_{n+2}+T_{n+1}+T_n$ for all n ≥ 0, and we find all triples of Tribonacci numbers which are multiplicatively dependent.