Meta-Fibonacci Sequences, Binary Trees, and Extremal Compact Codes
组合数学
2007-05-23 v1
摘要
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).
引用
@article{arxiv.math/0504400,
title = {Meta-Fibonacci Sequences, Binary Trees, and Extremal Compact Codes},
author = {Brad Jackson and Frank Ruskey},
journal= {arXiv preprint arXiv:math/0504400},
year = {2007}
}
备注
13 pages, 3 figures