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.

A352465 a(0) = 1; a(n) = (1/n) * Sum_{k=1..n} binomial(2*n,2*k)^2 * k * a(n-k).

Original entry on oeis.org

1, 1, 19, 1576, 356035, 172499176, 154989443170, 234120771123513, 553941959716031715, 1945912976888526218512, 9731900583801946493234794, 66990924607889809703423378253, 617312916540194845307221190273098, 7439659538258619452171059589120614701
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 17 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = (1/n) Sum[Binomial[2 n, 2 k]^2 k a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 13}]
    nmax = 26; Take[CoefficientList[Series[Exp[Sum[x^(2 k)/(2 k)!^2, {k, 1, nmax}]], {x, 0, nmax}], x] Range[0, nmax]!^2, {1, -1, 2}]

Formula

Sum_{n>=0} a(n) * x^(2*n) / (2*n)!^2 = exp( Sum_{n>=1} x^(2*n) / (2*n)!^2 ).
Sum_{n>=0} a(n) * x^(2*n) / (2*n)!^2 = exp( (BesselI(0,2*sqrt(x)) + BesselJ(0,2*sqrt(x))) / 2 - 1 ).

A352469 a(0) = 1; a(n) = (1/n) * Sum_{k=0..floor((n-1)/2)} binomial(n,2*k+1)^3 * (2*k+1) * a(n-2*k-1).

Original entry on oeis.org

1, 1, 4, 37, 640, 18401, 810616, 51506645, 4512303104, 526359723265, 79484297525704, 15182084413118525, 3598056798827450752, 1040872295660542894433, 362422517793599461361216, 150047916077302216370174237, 73081847594180657956494147584, 41481744863993143666887680079873
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 17 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = (1/n) Sum[Binomial[n, 2 k + 1]^3 (2 k + 1) a[n - 2 k - 1], {k, 0, Floor[(n - 1)/2]}]; Table[a[n], {n, 0, 17}]
    nmax = 17; CoefficientList[Series[Exp[Sum[x^(2 k + 1)/(2 k + 1)!^3, {k, 0, nmax}]], {x, 0, nmax}], x] Range[0, nmax]!^3

Formula

Sum_{n>=0} a(n) * x^n / n!^3 = exp( Sum_{n>=0} x^(2*n+1) / (2*n+1)!^3 ).
Showing 1-2 of 2 results.