0,5

Trees are unrooted; nodes are unlabeled and have degree <= 4.

Regarding stereoisomers as different means that only the alternating group A_4 acts at each node, not the full symmetric group S_4. See A000602 for the analogous sequence when stereoisomers are not counted as different.

Has also been described as steric planted trees (paraffins) with n nodes.

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Camb. 1998, p. 290.

C. M. Blair and H. R. Henze, The number of stereoisomeric and non-stereoisomeric paraffin hydrocarbons, J. Amer. Chem. Soc., 54 (1932), 1538-1545.

R. Davies and P. J. Freyd, C_{167}H_{336} is The Smallest Alkane with More Realizable Isomers than the Observable Universe has Particles, Journal of Chemical Education, Vol. 66, 1989, pp. 278-281.

J. L. Faulon, D. Visco and D. Roe, Enumerating Molecules, In: Reviews in Computational Chemistry Vol. 21, Ed. K. Lipkowitz, Wiley-VCH, 2005.

P. Leroux and B. Miloudi, ``G\'{e}n\'{e}ralisations de la formule d'Otter,'' Ann. Sci. Math. Qu\'{e}bec, Vol. 16, No. 1, pp. 53-80, 1992.

R. C. Read, The Enumeration of Acyclic Chemical Compounds, pp. 25-61 of A. T. Balaban, ed., Chemical Applications of Graph Theory, Ac. Press, 1976; see p. 44.

R. W. Robinson, F. Harary and A. T. Balaban, Numbers of chiral and achiral alkanes..., Tetrahedron 32 (1976), 355-361.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

Blair and Henze give recurrence (see the Maple code).

For even n a(n) = A086194(n) + A086200(n/2), for odd n a(n) = A086194(n).

s[0]:=1:s[1]:=1:for n from 0 to 60 do s[n+1/3]:=0 od:for n from 0 to 60 do s[n+2/3]:=0 od:for n from 0 to 60 do s[n+1/4]:=0 od:for n from 0 to 60 do s[n+1/2]:=0 od:for n from 0 to 60 do s[n+3/4]:=0 od:s[ -1]:=0:for n from 1 to 50 do s[n+1]:=(2*n/3*s[n/3]+sum(j*s[j]*sum(s[k]*s[n-j-k], k=0..n-j), j=1..n))/n od:for n from 0 to 50 do q[n]:=sum(s[i]*s[n-i], i=0..n) od:for n from 0 to 50 do q[n-1/2]:=0 od:for n from 0 to 40 do f:=n->(3*s[n]+2*s[n/2]+q[(n-1)/2]-q[n]+2*sum(s[j]*s[n-3*j-1], j=0..n/3))/4 od:seq(f(n), n=0..38); # the formulas for s[n+1] and f(n) are from eq.(4) and (12), respectively, of the Robinson et al. paper; s[n]=A000625(n), f(n)=A000628(n); q[n] is the convolution of s[n] with itself; (From Emeric Deutsch)

Equals A000626 + A000627. Cf. A000598, A000602, A000625, A010372, A010373, A086194, A086200.

Sequence in context: A162278 A027763 A060696 this_sequence A006888 A009589 A098179

Adjacent sequences: A000625 A000626 A000627 this_sequence A000629 A000630 A000631

nonn,easy,nice

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

Additional comments from Steve Strand (snstrand(AT)comcast.net), Aug 20, 2003.

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 16 2004