Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120526
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120526 First differences of successive generalized meta-Fibonacci numbers A120504. +0
3
1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 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, 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, 1, 1, 0, 1 (list; graph; listen)
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^(2 * [1])) / (1 - z^[1]) + z^4 * (1 - z^(3 * [i]))/(1 - z^[1]) ( (1 - z^(2 * [2])) / (1 - z^[2]) + z^10 * (1 - z^(3 * [2]))/(1 - z^[2]) (..., where [i] = (3^i - 1) / 2.

g.f.: D(z) = (1 - z) * z * sum(prod(z * (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 A120504(n)-A120504(n-1) fi;

CROSSREFS

Cf. A120504, A120515.

Sequence in context: A108882 A070829 A118175 this_sequence A086694 A093317 A127253

Adjacent sequences: A120523 A120524 A120525 this_sequence A120527 A120528 A120529

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research