login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120530 First differences of successive generalized meta-Fibonacci numbers A120508. 2
1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1 (list; graph; refs; listen; history; 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]

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^(3 * [1])) / (1 - z^[1]) + z^5 * (1 - z^(4 * [i]))/(1 - z^[1]) ( (1 - z^(3 * [2])) / (1 - z^[2]) + z^17 * (1 - z^(4 * [2]))/(1 - z^[2]) (..., where [i] = (4^i - 1) / 3.

g.f.: D(z) = z * (1-z) * sum(prod(z * (1 - z^(4 * [i])) / (1 - z^[i]), i=1..n), n=0..infinity), where [i] = (4^i - 1) / 3., Jun 20 2006

MAPLE

d := n -> if n=1 then 1 else A120508(n)-A120508(n-1) fi;

CROSSREFS

Cf. A120508, A120519.

Sequence in context: A118251 A099076 A175479 * A078616 A104106 A141260

Adjacent sequences:  A120527 A120528 A120529 * A120531 A120532 A120533

KEYWORD

nonn

AUTHOR

Frank Ruskey (http://www.cs.uvic.ca/~ruskey/) and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 03:34 EST 2012. Contains 205569 sequences.