Meta-Fibonacci sequences, binary trees and extremal compact codes

被引：0
|
作者：
Jackson, B [1 ]
Ruskey, F
机构：
[1] San Jose State Univ, Dept Math, San Jose, CA 95192 USA
[2] Univ Victoria, Dept Comp Sci, Victoria, BC, Canada
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2006年 / 13卷 / 01期
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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).
引用
收藏
页数：13
相关论文
共 50 条
12345