Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A036591
%S A036591 1,1,1,2,3,6,11,23,46,97,198,406,811,1613,3155,6141,11822,22652,
%T A036591 43052,81441,153031,286187,532067,984509,1811933,3319129,6049533,
%U A036591 10975090,19815546,35613904,63710026,113457471,201128376,354949071
%N A036591 Number of binary rooted trees with n nodes and height at most 8.
%H A036591 E. M. Rains and N. J. A. Sloane, <a href="http://www.cs.uwaterloo.ca/
               journals/JIS/index.html">On Cayley's Enumeration of Alkanes (or 4-Valent 
               Trees).</a>, J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.
%H A036591 <a href="Sindx_Ro.html#rooted">Index entries for sequences related to 
               rooted trees</a>
%Y A036591 Sequence in context: A123769 A093304 A036590 this_sequence A036592 A001190 
               A036656
%Y A036591 Adjacent sequences: A036588 A036589 A036590 this_sequence A036592 A036593 
               A036594
%K A036591 nonn,fini
%O A036591 0,4
%A A036591 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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research