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.

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

Original entry on oeis.org

1, 1, 37, 8551, 6886069, 14323022551, 64085654997739, 545107167737695109, 8062740187879748199029, 193866963305030079530064391, 7188682292472952994057436691387, 394013888612808806428687953794890229, 30829606055995735731623164115609901072859
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 17 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = Sum[Binomial[2 n, 2 k]^2 a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 12}]
    nmax = 24; Take[CoefficientList[Series[1/(1 - 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 = 1 / (1 - Sum_{n>=1} x^(2*n) / (2*n)!^2).
Sum_{n>=0} a(n) * x^(2*n) / (2*n)!^2 = 1 / (2 - (BesselI(0,2*sqrt(x)) + BesselJ(0,2*sqrt(x))) / 2).

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

Original entry on oeis.org

1, 1, 8, 217, 13952, 1752001, 380168432, 130996038265, 67377689108480, 49343690620021249, 49570079811804165008, 66280482720537078211945, 115058150837606807142692096, 253942526419333142443328522689, 700015299612132412448976873339008
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 17 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, 2 k + 1]^3 a[n - 2 k - 1], {k, 0, Floor[(n - 1)/2]}]; Table[a[n], {n, 0, 14}]
    nmax = 14; CoefficientList[Series[1/(1 - 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 = 1 / (1 - Sum_{n>=0} x^(2*n+1) / (2*n+1)!^3).
Showing 1-2 of 2 results.