Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036443
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036443 Number of ternary rooted trees with n nodes and height exactly 3. +0
1
0, 0, 0, 1, 2, 4, 4, 5, 4, 4, 3, 2, 1, 1 (list; graph; listen)
OFFSET

0,5

LINKS

Index entries for sequences related to rooted trees

CROSSREFS

Cf. A036370, A036437.

Sequence in context: A009292 A009622 A144565 this_sequence A036437 A053306 A108422

Adjacent sequences: A036440 A036441 A036442 this_sequence A036444 A036445 A036446

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), 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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research