A family of meta-Fibonacci sequences defined by variable order recursions

Simple item page
dc.creatorEmerson, Nathaniel D.
dc.date2005-08-26
dc.date2005-09-30
dc.date.accessioned2026-07-07T06:20:30Z
dc.date.available2026-07-07T06:20:30Z
dc.descriptionWe define a family of meta-Fibonacci sequences where the order of the of recursion at stage n is a variable r(n), and the n^{th} term of a sequence is the sum of the previous r(n) terms. For the terms of any such sequence, we give upper and lower bounds which depend only on r(n).
dc.description19 pages, this version includes a correction to Corollary 2.15
dc.identifierhttps://arxiv.org/abs/math/0508522
dc.identifierhttp://arxiv.org/abs/math/0508522
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/95343
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject11B37, 11B39
dc.titleA family of meta-Fibonacci sequences defined by variable order recursions
dc.typetext

Files

Collections

arXiv