cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A000631 Number of ethylene derivatives with n carbon atoms.

Original entry on oeis.org

1, 1, 3, 5, 13, 27, 66, 153, 377, 914, 2281, 5690, 14397, 36564, 93650, 240916, 623338, 1619346, 4224993, 11062046, 29062341, 76581151, 202365823, 536113477, 1423665699, 3788843391, 10103901486, 26995498151, 72253682560, 193706542776
Offset: 2

Views

Author

Keywords

Comments

Number of structural isomers of alkenes C_n H_{2n} with n carbon atoms.
Number of unicyclic graphs of n nodes where a double-edge replaces the cycle, [A217781], end-points of the double-edge of out-degrees <= 2, other nodes having out-degrees <= 3.
Number of rooted trees on n+1 nodes where the root has degree 2, the 2 children of the root have out-degrees <= 2, and the other nodes have out-degrees <= 3.
See illustration of initial terms. - Washington Bomfim, Nov 30 2020

References

  • J. L. Faulon, D. Visco and D. Roe, Enumerating Molecules, In: Reviews in Computational Chemistry Vol. 21, Ed. K. Lipkowitz, Wiley-VCH, 2005.
  • 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).

Crossrefs

Cf. A000642, A000598, A027852 (out-degrees of nodes not limited).

Programs

  • PARI
    \\ Here G(n) is A000598 as g.f., h is A000642.
    seq(n)={my(g=G(n), h=(subst(g, x, x^2) + g^2)/2); Vec(subst(h, x, x^2) + h^2)/2} \\ Andrew Howroyd, Dec 01 2020

Formula

a(n) = b(1)b(n-1) + b(2)b(n-2) + b(3)b(n-3) + ... + b(n/2)(b(n/2) + 1)/2 when n is even or b(1)b(n-1) + b(2)b(n-2) + b(3)b(n-3) + ... + b((n-1)/2)b((n + 1)/2) when n is odd, where b(n) = A000642(n). - Herman Jamke (hermanjamke(AT)fastmail.fm), Feb 24 2008
a(n) = Sum_{k=1..(n-1)/2}( f(k) * f(n-k) ) + [n mod 2 = 0] * ( f(n/2)^2 + f(n/2) ) / 2 where f(n) = A000642(n+1). - Washington Bomfim, Nov 29 2020
G.f.: (g(x^2) + g(x)^2)/2 where x*g(x) is the g.f. of A000642. - Andrew Howroyd, Dec 01 2020

Extensions

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Feb 24 2008