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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036372 Number of ternary rooted trees with n nodes and height at most 4. 0
1, 1, 1, 2, 4, 7, 12, 20, 31, 47, 70, 99, 137, 184, 239, 300, 369, 432, 498, 551, 594, 614, 624, 601, 570, 514, 453, 378, 312, 238, 181, 128, 89, 56, 37, 20, 12, 6, 3, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

LINKS

Index entries for sequences related to rooted trees

FORMULA

If T_i(z) = g.f. for ternary trees of height at most i, T_{i+1}(z)=1+z*(T_i(z)^3/6+T_i(z^2)*T_i(z)/2+T_i(z^3)/3); T_0(z) = 1.

CROSSREFS

Sequence in context: A010672 A122515 A193840 * A132218 A101230 A128129

Adjacent sequences:  A036369 A036370 A036371 * A036373 A036374 A036375

KEYWORD

nonn,full,fini

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), E. M. Rains (rains(AT)caltech.edu)

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 15 10:28 EST 2012. Contains 205763 sequences.