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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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).
13 pages, 3 figures

Keywords

Combinatorics, 05A15; 11B39

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/74951

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0504400
 http://arxiv.org/abs/math/0504400

Collections

arXiv