login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120527 First differences of successive generalized meta-Fibonacci numbers A120505. 2
1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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]
FORMULA
d(n) = 0 if node n is an inner node, or 1 if node n is a leaf.
g.f. z (1 + z^3 ( (1 - z^(2 * [1])) / (1 - z^[1]) + z^5 * (1 - z^(3 * [i]))/(1 - z^[1]) ( (1 - z^(2 * [2])) / (1 - z^[2]) + z^11 * (1 - z^(3 * [2]))/(1 - z^[2]) (..., where [i] = (3^i - 1) / 2.
g.f.: D(z) = z * (1 - z^2) * sum(prod(z^2 * (1 - z^(3 * [i])) / (1 - z^[i]), i=1..n), n=0..infinity), where [i] = (3^i - 1) / 2.
MAPLE
d := n -> if n=1 then 1 else A120505(n)-A120505(n-1) fi;
CROSSREFS
Sequence in context: A214293 A323096 A359379 * A188093 A190843 A287772
KEYWORD
nonn
AUTHOR
Frank Ruskey and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)