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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024358 Sum of the sizes of binary subtrees of the perfect binary tree of height n. 0
1, 1, 8, 105, 6136, 8766473, 8245941529080, 3508518207951157937469961, 311594265746788494170062926869662848646207622648, 1217308491239906829392988008143949647398943617188660186130545502913055217344025410733271773705 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Size of binary tree = number of internal nodes.

LINKS

C. Banderier, On the sum of the sizes of binary subtrees of a perfect binary tree, preprint, 2000

FORMULA

a(n) = B'_n(1) where B_{n+1}(x)=1+xB_n(x)^2.

CROSSREFS

Cf. A003095.

Sequence in context: A001922 A113551 A082735 * A055406 A155632 A129278

Adjacent sequences:  A024355 A024356 A024357 * A024359 A024360 A024361

KEYWORD

easy,nonn

AUTHOR

Cyril Banderier (Cyril.Banderier(AT)inria.fr), Jun 09 2000

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 02:34 EST 2012. Contains 205567 sequences.