Meta-Fibonacci sequences, binary trees and extremal compact codes
The electronic journal of combinatorics, Tome 13 (2006)
We consider 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).
DOI :
10.37236/1052
Classification :
11B39, 05C05, 05A15, 05A19
Mots-clés : generating functions, meta-Fibonacci sequences
Mots-clés : generating functions, meta-Fibonacci sequences
@article{10_37236_1052,
author = {Brad Jackson and Frank Ruskey},
title = {Meta-Fibonacci sequences, binary trees and extremal compact codes},
journal = {The electronic journal of combinatorics},
year = {2006},
volume = {13},
doi = {10.37236/1052},
zbl = {1084.05004},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1052/}
}
Brad Jackson; Frank Ruskey. Meta-Fibonacci sequences, binary trees and extremal compact codes. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1052
Cité par Sources :