Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036374
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036374 Number of ternary rooted trees with n nodes and height at most 6. +0
1
1, 1, 1, 2, 4, 8, 17, 38, 82, 177, 376, 789, 1638, 3376, 6894, 13987, 28181, 56424, 112282, 222171, 437098, 855311, 1664755, 3223402, 6209505, 11901967, 22700056, 43083657, 81376732, 152971812, 286199220, 532954482, 987861697, 1822655134 (list; graph; listen)
OFFSET

0,4

LINKS

E. M. Rains and N. J. A. Sloane, On Cayley's Enumeration of Alkanes (or 4-Valent Trees), J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.

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: A085022 A003426 A087803 this_sequence A084635 A154222 A114199

Adjacent sequences: A036371 A036372 A036373 this_sequence A036375 A036376 A036377

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research