Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036373
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036373 Number of ternary rooted trees with n nodes and height at most 5. +0
1
1, 1, 1, 2, 4, 8, 16, 33, 63, 121, 225, 415, 749, 1344, 2365, 4129, 7106, 12104, 20354, 33883, 55706, 90628, 145729, 231801, 364555, 567206, 872727, 1328545, 2000536, 2980554, 4393287, 6407683, 9246830, 13204526, 18657905, 26088244 (list; graph; listen)
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: A078227 A138814 A137181 this_sequence A119610 A121485 A098588

Adjacent sequences: A036370 A036371 A036372 this_sequence A036374 A036375 A036376

KEYWORD

nonn,fini

AUTHOR

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

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research