Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036601
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036601 Number of binary rooted trees with n nodes and height exactly 12. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 11, 65, 283, 1030, 3335, 9952, 27987, 75287, 195752, 495613, 1228577, 2994065, 7195616, 17094566, 40219347, 93848187, 217433025, 500640356, 1146414797, 2612325990, 5926402180, 13390758445 (list; graph; listen)
OFFSET

0,14

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

CROSSREFS

Sequence in context: A053367 A163706 A054333 this_sequence A125321 A054490 A126479

Adjacent sequences: A036598 A036599 A036600 this_sequence A036602 A036603 A036604

KEYWORD

nonn,fini

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research