Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036372
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A036372
%S A036372 1,1,1,2,4,7,12,20,31,47,70,99,137,184,239,300,369,432,498,551,
%T A036372 594,614,624,601,570,514,453,378,312,238,181,128,89,56,37,20,12,
%U A036372 6,3,1,1
%N A036372 Number of ternary rooted trees with n nodes and height at most 4.
%H A036372 <a href="Sindx_Ro.html#rooted">Index entries for sequences related to 
               rooted trees</a>
%F A036372 If T_i(z) = g.f. for ternary trees of height at most i, T_{i+1}(z)=1+z*(T_i(z)^3/
               6+T_i(z^2)*T_i(z)/2+T_i(z^3)/3); T_0(z) = 1.
%Y A036372 Sequence in context: A105856 A010672 A122515 this_sequence A132218 A101230 
               A128129
%Y A036372 Adjacent sequences: A036369 A036370 A036371 this_sequence A036373 A036374 
               A036375
%K A036372 nonn,full,fini
%O A036372 0,4
%A A036372 N. J. A. Sloane (njas(AT)research.att.com), E. M. Rains (rains(AT)caltech.edu)

    
page 1

Search completed in 0.001 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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research