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.

A132608 Self-convolution square-root of A062817 (offset 2); thus g.f. A(x) satisfies: A(x)^2 = Sum_{n>=2} A062817(n)*x^n, where A062817(n) = Sum_{k=0..n} (n-k)^k*k^(n-k).

Original entry on oeis.org

1, 2, 9, 58, 469, 4530, 50491, 634790, 8861043, 135750454, 2262315973, 40726646802, 787471241647, 16275700505510, 358103286781293, 8357593147404346, 206241859929682177, 5366082228239257410
Offset: 1

Views

Author

Paul D. Hanna, Aug 26 2007

Keywords

Examples

			A(x) = x + 2x^2 + 9x^3 + 58x^4 + 469x^5 + 4530x^6 +...+ a(n)*x^n +...
A(x)^2 = x^2 + 4x^3 + 22x^4 + 152x^5 + 1251x^6 +...+ A062817(n)*x^n +...
		

Crossrefs

Programs

  • Mathematica
    nmax = 20; CoefficientList[Series[(Sum[x^(k-2) * Sum[(k-j)^j * j^(k-j), {j, 0, k}], {k, 1, 2*nmax}])^(1/2), {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 22 2021 *)
  • PARI
    {a(n)=polcoeff((sum(m=2,n+1,sum(k=0,m,(m-k)^k*k^(m-k))*x^m +x*O(x^(n+1))))^(1/2),n)}

Formula

a(n) ~ exp(1) * sqrt(2*Pi/3) * n^(n + 3/2) / 2^(n+3). - Vaclav Kotesovec, Nov 22 2021