AbstractA summation formula related to the Fibonacci expansion of integers is given
AbstractWe will show that the sum-of-digits function has an asymptotic Gaussian behaviour, and we de...
Recently Prodinger [2] proved general expansion formulas for sums of powers of Fibonacci and Lucas n...
Any increasing function p(d) on the natural numbers has an associated counting function ?(n) that yi...
AbstractA general formula for summation over weighted compositions is developed. From this a number ...
WOS: 000369178600007Recently Prodinger [2] proved general expansion formulas for sums of powers of F...
Abstract. A combinatorial argument is used to explain the integrality of Fi-bonomial coefficients an...
In his paper [1],J.G.Goggins has shown a simple formula which relates πand Fibonacci numbers. In thi...
AbstractA summation formula in algebraic number fields is established which resembles Siegel's summa...
In this paper we obtain some formulae for several sums of generalized Fibonacci numbers U-n and gene...
The note considers M-bonacci numbers, which are a generalization of Fibonacci numbers. Two new summa...
AbstractA Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci num...
As the power of the Fibonacci numbers increases from 1 to the power of 5, the number of terms obtai...
Recently, interest has been shown in summing infinite series of reciprocals of Fibonacci numbers [1]...
Here we are proposing generalized sums for Fibonacci and Lucas numbers. In the case of the Fibonacc...
Abstract. For positive integers n, let µ(n) be the Möbius function, and M(n) its sum M(n)
AbstractWe will show that the sum-of-digits function has an asymptotic Gaussian behaviour, and we de...
Recently Prodinger [2] proved general expansion formulas for sums of powers of Fibonacci and Lucas n...
Any increasing function p(d) on the natural numbers has an associated counting function ?(n) that yi...
AbstractA general formula for summation over weighted compositions is developed. From this a number ...
WOS: 000369178600007Recently Prodinger [2] proved general expansion formulas for sums of powers of F...
Abstract. A combinatorial argument is used to explain the integrality of Fi-bonomial coefficients an...
In his paper [1],J.G.Goggins has shown a simple formula which relates πand Fibonacci numbers. In thi...
AbstractA summation formula in algebraic number fields is established which resembles Siegel's summa...
In this paper we obtain some formulae for several sums of generalized Fibonacci numbers U-n and gene...
The note considers M-bonacci numbers, which are a generalization of Fibonacci numbers. Two new summa...
AbstractA Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci num...
As the power of the Fibonacci numbers increases from 1 to the power of 5, the number of terms obtai...
Recently, interest has been shown in summing infinite series of reciprocals of Fibonacci numbers [1]...
Here we are proposing generalized sums for Fibonacci and Lucas numbers. In the case of the Fibonacc...
Abstract. For positive integers n, let µ(n) be the Möbius function, and M(n) its sum M(n)
AbstractWe will show that the sum-of-digits function has an asymptotic Gaussian behaviour, and we de...
Recently Prodinger [2] proved general expansion formulas for sums of powers of Fibonacci and Lucas n...
Any increasing function p(d) on the natural numbers has an associated counting function ?(n) that yi...