Search: id:A005588
Results 1-1 of 1 results found.

%I A005588 M1813
%S A005588 2,7,52,2133,2590407,3374951541062,5695183504479116640376509,
%T A005588 16217557574922386301420514191523784895639577710480,
%U A005588 131504586847961235687181874578063117114329409897550318273792033024340388219235081096658023517076950
%N A005588 Number of free binary rooted trees of height n.
%D A005588 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A005588 F. Harary et al., Counting free binary trees..., J. Combin. Inform. System 
               Sciences, 17 (1992), 175-181.
%H A005588 David Wasserman, <a href="b005588.txt">Table of n, a(n) for n = 1..12</
               a>
%H A005588 David Wasserman, <a href="a005588.txt">Table of n, a(n) for n = 1..21</
               a>
%H A005588 <a href="Sindx_Ro.html#rooted">Index entries for sequences related to 
               rooted trees</a>
%H A005588 <a href="Sindx_Tra.html#trees">Index entries for sequences related to 
               trees</a>
%H A005588 <a href="Sindx_Cor.html#core">Index entries for "core" sequences</a>
%F A005588 Reference gives a complicated recurrence.
%Y A005588 Cf. A002658, A006894.
%Y A005588 Sequence in context: A138737 A046662 A118191 this_sequence A106898 A106899 
               A119772
%Y A005588 Adjacent sequences: A005585 A005586 A005587 this_sequence A005589 A005590 
               A005591
%K A005588 nonn,easy,core,nice
%O A005588 1,1
%A A005588 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds