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.

Showing 1-2 of 2 results.

A327882 a(n) = n*(2*(n-1))! for n > 0, a(0) = 1.

Original entry on oeis.org

1, 1, 4, 72, 2880, 201600, 21772800, 3353011200, 697426329600, 188305108992000, 64023737057280000, 26761922089943040000, 13488008733331292160000, 8065829222532112711680000, 5646080455772478898176000000, 4573325169175707907522560000000, 4244045756995056938180935680000000
Offset: 0

Views

Author

Bruno Zürcher, Sep 28 2019

Keywords

Comments

Even denominators of coefficients in Taylor series expansion of 2 - 2*cos(x) - 2*x*sin(x) + x^2.
Equivalent to the even denominators of expansion of (1-cos(x))^2 + (x-sin(x))^2, which is the square of the secant length measured from the origin (0,0) to the cycloid point (1-cos(x), x-sin(x)). Note that only x^4 has the first nonzero coefficient of the series.
Numerators of the Taylor series expansion are given by A327883.
The Taylor series itself has an expansion Sum_{k>=2} (-1)^k*2*(2*k-1)/(2*k)!*x^(2*k).

Examples

			2 + x^2 - 2*cos(x) - 2*x*sin(x) = (1/4)*x^4 - (1/72)*x^6 + (1/2880)*x^8 - (1/201600)*x^10 + (1/21772800)*x^12 - ...
		

Crossrefs

Programs

  • Mathematica
    Denominator[CoefficientList[ Series[2 - 2 Cos[x] - (2 x) Sin[x] + x^2, {x, 0, 33}], x][[ ;; ;; 2]]]
  • PARI
    a(n) = {if(n<1, n==0, (2*n)!/(2*(2*n-1)))} \\ Andrew Howroyd, Oct 09 2019

Formula

a(n) = (2*n)!/(2*(2*n-1)) = n*A010050(n-1) for n >= 1.
a(n) = A171005(2*n-1) for n >= 2. - Andrew Howroyd, Oct 09 2019
a(n) = (1/2)*(2*n)!*[x^(2*n)](1 + x*arctanh(x)) for n > 0. - Peter Luschny, Oct 09 2019
D-finite with recurrence a(n) -2*n*(2*n-3)*a(n-1)=0. - R. J. Mathar, Feb 01 2022

A233387 Number of labeled star graphs with added edges.

Original entry on oeis.org

32, 185, 1308, 10822, 102176, 1081908, 12681640, 162880256, 2273437392, 34249286656, 553698389888, 9558929197560, 175471796530816, 3412297318315472, 70064350595106336, 1514554957975079008, 34377185731361631680
Offset: 4

Views

Author

Geoffrey Critzer, Feb 02 2014

Keywords

Comments

Here, a star graph is a tree on n nodes (n>=4) with one specially designated (center) vertex, v of degree n-1. We are allowed to add edges so that the degree of any node (excepting v) is at most 3 and so that every cycle includes the vertex v with the possible exception of a single cycle of length n-1 through each non-center vertex. We note that anytime edges are added the original "center" node remains specially designated. a(n) is the number of such connected simple labeled graphs with a specially designated node.
If we don't add any edges we have a star graph and there are n labelings.
If we add exactly one edge then we produce a cycle of length 3 and we no longer have a tree.
If we add the maximum number of edges we get a wheel graph A171005.

Examples

			a(4) = 32. There are 4 labelings for the star graph on 4 nodes. There are 12 labelings after we add one edge. There are 12 labelings after we add two edges. There are 4 labelings after we add 3 edges. 4+12+12+4=32.
		

Crossrefs

Cf. A013989 (with appropriate offset) enumerates such graphs where the maximum degree of non-center vertices is restricted to 2.

Programs

  • Mathematica
    nn=20; a=x/(1-x)/2+x/2; Drop[Range[0,nn]! CoefficientList[Series[x Exp[a]+x (Log[1/(1-x)]/2+x^2/4+x/2), {x,0,nn}], x], 4]

Formula

Ignoring the first 4 terms the e.g.f. is: x*exp(A(x))+ x*(log(1/(1-x))/2 + x^2/4 + x/2) where A(x) = x/(1-x)/2 + x/2.
Showing 1-2 of 2 results.