|
%I M0358 N0135
%S 0,1,0,1,1,2,2,6,9,20,37,86,181,422,943,2223,5225,12613,30513,74883,
%T 184484,458561,1145406,2879870,7274983,18471060,47089144,120528657,
%U 309576725,797790928,2062142876,5345531935,13893615154,36201693122
%N Number of centered hydrocarbons with n atoms.
%D R. G. Busacker and T. L. Saaty, Finite Graphs and Networks,mcGraw-Hill, NY, 1965, p. 201 (they reproduce Cayley's mistakes).
%D A. Cayley, "On the mathematical theory of isomers", Phil. Mag. vol. 67 (1874), 444-447.
%D A. Cayley, "Ueber die analytischen Figuren, welche in der Mathematik Baeume genannt werden...", Chem. Ber. 8 (1875), 1056-1059.
%D H. R. Henze and C. M. Blair, The number of structurally isomeric alcohols of the methanol series, J. Amer. Chem. Soc., 53 (1931), 3042-3046.
%D H. R. Henze and C. M. Blair, The number of isomeric hydrocarbons of the methane series, J. Amer Chem Soc. 53 (1931) 3077-3085.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H N. J. A. Sloane, <a href="/A000022/b000022.txt">Table of n, a(n) for n = 0..60</a>
%H H. Bottomley, <a href="/A000602/a000602.gif">Illustration of initial terms of A000022, A000200, A000602</a>
%H 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 N. J. A. Sloane, <a href="http://neilsloane.com/doc/sg.txt">My favorite integer sequences</a>, in Sequences and their Applications (Proceedings of SETA '98).
%H N. J. A. Sloane, <a href="/A000602/a000602.txt">Maple program and first 60 terms for A000022, A000200, A000598, A000602, A000678</a>
%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%p # We continue from the Maple code in A000678: Unordered 4-tuples of ternary trees with one of height i and others of height at most i-1:
%p N := 45: i := 1: while i<(N+1) do Tb := t[ i ]-t[ i-1 ]: Ts := t[ i ]-1: Q2 := series(Tb*Ts+O(z^(N+1)),z,200): q2[ i ] := Q2: i := i+1; od: q2[ 0 ] := 0: q[ -1 ] := 0:
%p for i from 0 to N do c[ i ] := series(q[ i ]-q[ i-1 ]-q2[ i ]+O(z^(N+1)),z,200); od:
%p # erase height information: i := 'i': cent := series(sum(c[ i ],i=0..N),z,200); G000022 := cent; A000022 := n->coeff(G000022,z,n);
%p # continued in A000200.
%Y A000022+A000200=A000602. Cf. A010372.
%K nonn,easy,nice
%O 0,6
%A _N. J. A. Sloane_, E. M. Rains (rains(AT)caltech.edu)
|
