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

 

Logo


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

1,1

LINKS

Table of n, a(n) for n=1..75.

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

g.f.: D(z) = z * prod((1 - z^(4 * [i])) / (1 - z^[i])), i=1..infinity), where [i] = (4^i - 1) / 3.

MAPLE

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

CROSSREFS

Cf. A120507, A120518.

Sequence in context: A155076 A257196 A176137 * A099443 A132342 A156174

Adjacent sequences:  A120526 A120527 A120528 * A120530 A120531 A120532

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 19:36 EDT 2018. Contains 316293 sequences. (Running on oeis4.)