Meta-Fibonacci Sequences, Binary Trees, and Extremal Compact Codes

Simple item page
dc.creatorJackson, Brad
dc.creatorRuskey, Frank
dc.date2005-04-19
dc.date.accessioned2026-07-07T05:19:15Z
dc.date.available2026-07-07T05:19:15Z
dc.descriptionWe look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this family of meta-Fibonacci sequences and two families of related sequences we derive ordinary generating functions and recurrence relations. Included in these families of sequences are several well-known sequences in the Online Encyclopedia of Integer Sequences (OEIS).
dc.description13 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0504400
dc.identifierhttp://arxiv.org/abs/math/0504400
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74951
dc.subjectCombinatorics
dc.subject05A15; 11B39
dc.titleMeta-Fibonacci Sequences, Binary Trees, and Extremal Compact Codes
dc.typetext

Files

Collections

arXiv