A Symmetric Algorithm for Hyperharmonic and Fibonacci Numbers

Simple item page
dc.creatorDil, Ayhan
dc.creatorMezo, Istvan
dc.date2008-03-31
dc.date.accessioned2026-07-07T09:29:24Z
dc.date.available2026-07-07T09:29:24Z
dc.descriptionIn 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/0803.4388
dc.identifierhttp://arxiv.org/abs/0803.4388
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157771
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11B37; 11B39
dc.titleA Symmetric Algorithm for Hyperharmonic and Fibonacci Numbers
dc.typetext

Files

Collections

arXiv