Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036423
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036423 Number of ternary rooted trees with n nodes and height exactly 8. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 1, 7, 34, 129, 432, 1320, 3807, 10505, 28094, 73290, 187579, 472612, 1175580, 2892389, 7050272, 17045235, 40913418, 97571239, 231337744, 545590039, 1280487083, 2991833084, 6961385026, 16135193088, 37263361364 (list; graph; listen)
OFFSET

0,10

LINKS

Index entries for sequences related to rooted trees

CROSSREFS

Cf. A036370, A036437.

Sequence in context: A024817 A071598 A120470 this_sequence A036632 A036639 A036646

Adjacent sequences: A036420 A036421 A036422 this_sequence A036424 A036425 A036426

KEYWORD

nonn,fini

AUTHOR

njas, Eric 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research