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-5 of 5 results.

A251568 Expansion of e.g.f. exp(x*C(x)^2) where C(x) = 1 + x*C(x)^2 is the g.f. of the Catalan numbers, A000108.

Original entry on oeis.org

1, 1, 5, 43, 529, 8501, 169021, 4010455, 110676833, 3484717129, 123320412181, 4847038223171, 209536628422705, 9882471447634813, 505033804901100749, 27802319803528367791, 1640388588050579832001, 103275015543414629215505, 6910877628962983581031333
Offset: 0

Views

Author

Paul D. Hanna, Dec 05 2014

Keywords

Examples

			E.g.f.: A(x) = 1 + x + 5*x^2/2! + 43*x^3/3! + 529*x^4/4! + 8501*x^5/5! + ...
where
log(A(x)) = x + 2*x^2 + 5*x^3 + 14*x^4 + 42*x^5 + 132*x^6 + ... + A000108(n)*x^n + ...
		

Crossrefs

Programs

  • Maple
    CatalanNumber := n -> binomial(2*n,n)/(n+1):
    a := n -> `if`(n=0, 1, n!*CatalanNumber(n)*hypergeom([1-n], [2+n], -1)):
    seq(simplify(a(n)), n=0..9); # Peter Luschny, May 04 2017
  • Mathematica
    Flatten[{1,Table[Sum[n!/k!*Binomial[2*n-1,n-k]*2*k/(n+k),{k,1,n}],{n,1,20}]}] (* Vaclav Kotesovec, Feb 14 2015 *)
    a[0] = 1; a[n_] := (2n)!/(n+1)! Hypergeometric1F1[1-n, n+2, -1];
    Table[a[n], {n, 0, 20}] (* Jean-François Alcover, May 03 2017, after Vladimir Kruchinin *)
  • PARI
    {a(n)=my(C=1);for(i=1,n,C=1+x*C^2 +x*O(x^n));n!*polcoef(exp(x*C^2),n)}
    for(n=0,20,print1(a(n),", "))
    
  • PARI
    {a(n) = if(n==0, 1, sum(k=1, n, n!/k! * binomial(2*n-1, n-k) * 2*k/(n+k) ))}
    for(n=0, 20, print1(a(n), ", "))
    
  • PARI
    my(N=20, x='x+O('x^N)); Vec(serlaplace(exp(serreverse(x*(1-x))^2/x))) \\ Seiichi Manyama, Mar 15 2025

Formula

a(n) = Sum_{k=0..n} (n!/k!) * binomial(2*n-1, n-k) * 2*k/(n+k) for n > 0 with a(0)=1.
E.g.f. A(x) satisfies: A'(x)/A(x) = C'(x) = C(x)^2 / sqrt(1-4*x) where C(x) = (1-sqrt(1-4*x))/(2*x) is the Catalan function.
Recurrence equation: a(n) = -(n^2 - 5*n +1)*a(n-1) + n*(2*n - 3)*(2*n - 4)*a(n-2) with a(0) = 1, a(1) = 1. It appears that a(n) - 1 is divisible by n*(n - 1) for n >= 2. - Peter Bala, Feb 14 2015
a(n) ~ 2^(2*n+1/2) * n^(n-1) / exp(n-1). - Vaclav Kotesovec, Feb 14 2015
a(n) are special values of the hypergeometric function 1F1: a(n) = 4^n*Gamma(n+1/2)*exp(-1)*hypergeom([2*n+1], [n+2], 1)/(sqrt(Pi)*(n+1)), for n>=1. - Karol A. Penson, Jun 01 2015
a(n) = ((2*n)!/(n+1)!)*hypergeometric([1-n],[n+2],-1), a(0)=1. - Vladimir Kruchinin, May 03 2017
From Seiichi Manyama, Mar 15 2025: (Start)
E.g.f.: exp( (1/x) * Series_Reversion( x*(1-x) )^2 ).
E.g.f.: exp( Series_Reversion( x/(1+x)^2 ) ). (End)

A380515 Expansion of e.g.f. exp(x*G(x)^3) where G(x) = 1 + x*G(x)^4 is the g.f. of A002293.

Original entry on oeis.org

1, 1, 7, 109, 2689, 91261, 3950191, 208064137, 12917499169, 923765042809, 74780847503191, 6760168138392901, 675023676995501857, 73787463232202560309, 8763902701210982610559, 1123850728979698205132641, 154757223522414820829369281, 22775744033825102490806751217
Offset: 0

Views

Author

Seiichi Manyama, Jan 26 2025

Keywords

Crossrefs

Programs

  • PARI
    a(n) = if(n==0, 1, 3*n!*sum(k=0, n-1, binomial(3*n+k, k)/((3*n+k)*(n-k-1)!)));

Formula

a(n) = 3 * n! * Sum_{k=0..n-1} binomial(3*n+k,k)/((3*n+k) * (n-k-1)!) for n > 0.
a(n) = U(1-n, 2-4*n, 1), where U is the Tricomi confluent hypergeometric function. - Stefano Spezia, Jan 26 2025
E.g.f.: exp( Series_Reversion( x*(1-x)^3 ) ). - Seiichi Manyama, Mar 15 2025

A380512 Expansion of e.g.f. exp(x*G(x)^3) where G(x) = 1 + x*G(x)^3 is the g.f. of A001764.

Original entry on oeis.org

1, 1, 7, 91, 1753, 45001, 1447471, 56041987, 2539200721, 131859347473, 7723214721271, 503787793244011, 36223369111466857, 2846582772323685721, 242741539845295265503, 22325483241906758894611, 2202979676409063904473121, 232158319570869255177386017, 26024052774273208806612761191
Offset: 0

Views

Author

Seiichi Manyama, Jan 26 2025

Keywords

Crossrefs

Programs

  • PARI
    a(n) = if(n==0, 1, (n-1)!*pollaguerre(n-1, 2*n+1, -1));

Formula

E.g.f.: exp(G(x)-1), where G(x) is described above.
a(n) = (n-1)! * Sum_{k=0..n-1} binomial(3*n,k)/(n-k-1)! for n > 0.
a(n+1) = n! * LaguerreL(n, 2*n+3, -1).
a(n) = (-1)^(n+1)*U(1-n, 2*(1+n), -1), where U is the Tricomi confluent hypergeometric function. - Stefano Spezia, Jan 26 2025
E.g.f.: exp( Series_Reversion( x/(1+x)^3 ) ). - Seiichi Manyama, Mar 15 2025

A380640 Expansion of e.g.f. exp(x*G(2*x)^2) where G(x) = 1 + x*G(x)^3 is the g.f. of A001764.

Original entry on oeis.org

1, 1, 9, 193, 6673, 319521, 19575001, 1461908449, 128828471073, 13086232224193, 1505486837413801, 193477959856396161, 27472294970916814129, 4271180551913140331233, 721640087945607030774393, 131656978622706616938932641, 25795404137789777215960879681, 5402020596794976601680149234049
Offset: 0

Views

Author

Seiichi Manyama, Jan 28 2025

Keywords

Crossrefs

Programs

  • PARI
    a(n) = if(n==0, 1, 2*n!*sum(k=0, n-1, 2^k*binomial(2*n+k, k)/((2*n+k)*(n-k-1)!)));

Formula

a(n) = 2 * n! * Sum_{k=0..n-1} 2^k * binomial(2*n+k,k)/((2*n+k) * (n-k-1)!) for n > 0.
From Vaclav Kotesovec, Jan 29 2025: (Start)
E.g.f. A(x) satisfies x = log(A(x)) * (1 - 2*log(A(x)))^2.
a(n) ~ 3^(3*n - 3/2) * n^(n-1) / (2^(n + 1/2) * exp(n - 1/6)). (End)
a(n) = 2^(n-1)*U(1-n, 2-3*n, 1/2), where U is the Tricomi confluent hypergeometric function. - Stefano Spezia, Jan 29 2025
E.g.f.: exp( Series_Reversion( x*(1-2*x)^2 ) ). - Seiichi Manyama, Mar 16 2025

A380603 Expansion of e.g.f. exp(2*x*G(x)^2) where G(x) = 1 + x*G(x)^3 is the g.f. of A001764.

Original entry on oeis.org

1, 2, 12, 140, 2512, 61392, 1905184, 71781824, 3183563520, 162497556224, 9383803201024, 604888546242048, 43056560538093568, 3354362248463544320, 283895464602180231168, 25938521255822517813248, 2544584391277895815069696, 266765818037212169468706816, 29764238411096397030375424000
Offset: 0

Views

Author

Seiichi Manyama, Jan 28 2025

Keywords

Crossrefs

Programs

  • PARI
    a(n) = if(n==0, 1, 2*n!*sum(k=0, n-1, 2^(n-k)*binomial(2*n+k, k)/((2*n+k)*(n-k-1)!)));

Formula

E.g.f.: B(x)^2, where B(x) is the e.g.f. of A380511.
a(n) = 2 * n! * Sum_{k=0..n-1} 2^(n-k) * binomial(2*n+k,k)/((2*n+k) * (n-k-1)!) for n > 0.
Showing 1-5 of 5 results.