In this paper we use the Euler-Seidel method for deriving new identities for hyperharmonic and r-Stirling numbers. The exponential generating function is determined for hyperharmonic numbers, which result is a generalization of Gosper’s identity. A classification of second order recurrence sequences is also given with the help of this method.

We note that every positive integer N has a representation as a sum of distinct members of the sequence ${d(n!)}_{n\ge 1}$, where d(m) is the number of divisors of m. When N is a member of a binary recurrence $u={uₙ}_{n\ge 1}$ satisfying some mild technical conditions, we show that the number of such summands tends to infinity with n at a rate of at least c₁logn/loglogn for some positive constant c₁. We also compute all the Fibonacci numbers of the form d(m!) and d(m₁!) + d(m₂)! for some positive integers m,m₁,m₂.

Let d ≥ 2 be an integer. In 2010, the second, third, and fourth authors gave necessary and sufficient conditions for the infinite products ${\prod }_{\genfrac{}{}{0pt}{}{k=1}{U_{d^k}\ne -a_i}}^{\infty }(1+\left(a_i\right)/\left(U_{d^k}\right))$ (i=1,...,m) or ${\prod }_{\genfrac{}{}{0pt}{}{k=1}{V_{d^k}\ne -a_i}}^{\infty }(1+\left(a_i\right)\left(V_{d^k}\right)$ (i=1,...,m) to be algebraically dependent, where $a_i$ are non-zero integers and $U_n$ and $V_n$ are generalized Fibonacci numbers and Lucas numbers, respectively. The purpose of this paper is to relax the condition on the non-zero integers $a_1,...,a_m$ to non-zero real algebraic numbers, which gives new cases where the infinite products above are algebraically dependent....

We present a constructive procedure for establishing explicit formulas of the constituents matrices. Our approach is based on the tools and techniques from the theory of generalized Fibonacci sequences. Some connections with other results are supplied. Furthermore,we manage to provide tractable expressions for the matrix functions, and for illustration purposes we establish compact formulas for both the matrix logarithm and the matrix pth root. Some examples are also provided.

Using the lower bound of linear forms in logarithms of Matveev and the theory of continued fractions by means of a variation of a result of Dujella and Pethő, we find all $k$-Fibonacci and $k$-Lucas numbers which are Fermat numbers. Some more general results are given.

In occasione della commemorazione dell’800-esimo anniversario della pubblicazione del Liber Abaci, desidero richiamare l’attenzione del lettore su alcuni dei fatti che preferisco riguardanti numeri di Fibonacci. Tali fatti includono la presenza di quadrati, di multipli di quadrati e di numeri potenti tra i numeri di Fibonacci, la rappresentazione di numeri reali e la costruzione di numeri trascendenti mediante numeri di Fibonacci, la possibilità di costruire una serie zeta ed un dominio a fattorizzazione...

Let Fₙ be the Fibonacci sequence defined by F₀=0, F₁=1, $F_{n+1}=Fₙ+F_{n-1}\left(n\ge 1\right)$. It is well known that $F_{p-(5/p)}\equiv 0\left(modp\right)$ for any odd prime p, where (-) denotes the Legendre symbol. In 1960 D. D. Wall [13] asked whether $p²|F_{p-(5/p)}$ is always impossible; up to now this is still open. In this paper the sum ${\sum }_{k\equiv r\left(mod10\right)}\left(\genfrac{}{}{0pt}{}{n}{k}\right)$ is expressed in terms of Fibonacci numbers. As applications we obtain a new formula for the Fibonacci quotient $F_{p-(5/p)}/p$ and a criterion for the relation $p|F_{(p-1)/4}$ (if p ≡ 1 (mod 4), where p ≠ 5 is an odd prime. We also prove that the affirmative answer to...