A symmetric algorithm for hyperharmonic and Fibonacci numbers

From MaRDI portal



Abstract: In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers. An explicit formulae for hyperharmonic numbers, general generating functions of the Fibonacci- and Lucas numbers are obtained. Besides we define "hyperfibonacci numbers", "hyperlucas numbers". Using these new concepts, some relations between ordinary and incomplete Fibonacci- and Lucas numbers are investigated.


The article is devoted to a new symmetric algorithm for some recurrence relation that is an analogue of the Euler-Seidel algorithm. The authors demonstrate the use of this algorithm to hyperharmonic, ordinary and incomplete Fibonacci and Lucas numbers. They obtain an explicit formula for hyperharmonic numbers. General generating functions of the Fibonacci and Lucas numbers are presented.




Cited in
(40)








This page was built for publication: A symmetric algorithm for hyperharmonic and Fibonacci numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378719)