Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036375
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036375 Number of ternary rooted trees with n nodes and height at most 7. +0
1
1, 1, 1, 2, 4, 8, 17, 39, 88, 203, 464, 1056, 2381, 5344, 11900, 26381, 58165, 127713, 279209, 608213, 1319985, 2855275, 6155981, 13231553, 28353787, 60583959, 129084369, 274283708, 581244959, 1228514486, 2589902750, 5446168197 (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: A049312 A132043 A055545 this_sequence A036376 A000598 A003008

Adjacent sequences: A036372 A036373 A036374 this_sequence A036376 A036377 A036378

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.005 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research