|
| |
|
|
A120522
|
|
First differences of successive meta-Fibonacci numbers A006949.
|
|
1
| |
|
|
1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| B. Jackson and F. Ruskey, Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes, Electronic Journal of Combinatorics, 13 (2006), #R26, 13 pages.
|
|
|
LINKS
| C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences, J. Integer Seq., Vol. 12. [This is a later version than that in the GenMetaFib.html link]
C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences
|
|
|
FORMULA
| d(n) = 0 if node n is an inner node, or 1 if node n is a leaf.
g.f.: z (1 + z^2 ( (1 - z^[1]) / (1 - z^[1]) + z^3 * (1 - z^(2 * [i]))/(1 - z^[1]) ( (1 - z^[2]) / (1 - z^[2]) + z^5 * (1 - z^(2 * [2]))/(1 - z^[2]) (..., where [i] = (2^i - 1).
|
|
|
MAPLE
| d := n -> if n=1 then 1 else A006949(n)-A006949(n-1) fi;
|
|
|
CROSSREFS
| Cf. A006949, A120511.
Sequence in context: A039983 A152490 A145273 * A157423 A098033 A135022
Adjacent sequences: A120519 A120520 A120521 * A120523 A120524 A120525
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Frank Ruskey (http://www.cs.uvic.ca/~ruskey/) and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006
|
| |
|
|
