OFFSET
0,3
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. D. Noe, Table of n, a(n) for n = 0..100
D. J. Broadhurst, Four-loop Dyson-Schwinger-Johnson anatomy, arXiv:hep-ph/9909336, 1999.
P. Cvitanovic, Asymptotic estimates and gauge invariance, Nuclear Phys. B 127 (1977), 176-188.
R. J. Martin and M. J. Kearney, An exactly solvable self-convolutive recurrence, arXiv:1103.4936 [math.CO], 2011.
R. J. Martin and M. J. Kearney, An exactly solvable self-convolutive recurrence, Aequat. Math., 80 (2010), 291-318. see p. 292.
FORMULA
EXAMPLE
G.f. = 1 + x + 6*x^2 + 50*x^3 + 518*x^4 + 6354*x^5 + 89782*x^6 + 1435330*x^7 + ...
MATHEMATICA
m = 19; s[x_] = Sum[(2*n)!/(2^n*n!)*x^n, {n, 0, m}]; gf[x_] = (s[x] - 1)/(s[x]^2*x); Most[CoefficientList[Series[gf[x], {x, 0, m}], x]] (* Jean-François Alcover, Aug 31 2011, after g.f. *)
PROG
(PARI) {a(n) = my(A); if( n<0, 0, A = sum( k=0, n+1, (2*k)! / k! /2^k * x^k, x^2 * O(x^n)); polcoeff( (A - 1) / (x * A^2), n))}; /* Michael Somos, Oct 11 2006 */
(PARI) {a(n) = my(A); if( n<1, n==0, A = vector(n); A[1] = 1; for( k=2, n, A[k] = (2 * k - 3) * A[k-1] + sum( j=1, k-1, A[j] * A[k-j])); (2*n - 1) * A[n])}; /* Michael Somos, Jul 24 2011 */
CROSSREFS
KEYWORD
nonn,nice,easy
AUTHOR
STATUS
approved