login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036601 Number of binary rooted trees with n nodes and height exactly 12. 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; refs; listen; history; text; internal format)
OFFSET

0,14

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..4095

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: A054333 A267173 A266765 * A125321 A054490 A126479

Adjacent sequences:  A036598 A036599 A036600 * A036602 A036603 A036604

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 6 02:13 EDT 2020. Contains 335475 sequences. (Running on oeis4.)