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.

A090355 G.f. satisfies A^4 = BINOMIAL(A)^3.

Original entry on oeis.org

1, 3, 15, 109, 1086, 14178, 232906, 4647006, 109376595, 2967406345, 91130074437, 3123199831983, 118106517900868, 4883161763750820, 219076867059030300, 10597531747143624820, 549768536732090716371, 30443800514118532762329
Offset: 0

Views

Author

Paul D. Hanna, Nov 26 2003

Keywords

Comments

See comments in A090353.

Crossrefs

Programs

  • Mathematica
    nmax = 17; sol = {a[0] -> 1};
    Do[A[x_] = Sum[a[k] x^k, {k, 0, n}] /. sol; eq = CoefficientList[A[x]^4 - A[x/(1 - x)]^3/(1 - x)^3 + O[x]^(n + 1), x] == 0 /. sol; sol = sol ~Join~ Solve[eq][[1]], {n, 1, nmax}];
    sol /. Rule -> Set;
    a /@ Range[0, nmax] (* Jean-François Alcover, Nov 02 2019 *)
  • PARI
    {a(n)=local(A); if(n<1,0,A=1+x+x*O(x^n); for(k=1,n,B=subst(A,x,x/(1-x))/(1-x)+x*O(x^n); A=A-A^4+B^3);polcoeff(A,n,x))}

Formula

G.f.: A(x)^4 = A(x/(1-x))^3/(1-x)^3.
From Peter Bala, May 26 2015: (Start)
O.g.f.: A(x) = exp( Sum_{n >= 1} b(n)*x^n/n ), where b(n) = Sum_{k = 1..n} k!*Stirling2(n,k)*3^k = A032033(n) = 3*A050352(n).
BINOMIAL(A(x)) = exp( Sum_{n >= 1} c(n)*x^n/n ) where c(n) = (-1)^n*Sum_{k = 1..n} k!*Stirling2(n,k)*4^k = A201354(n) = 4*A050352(n) for n >= 1. A(x) = B(x)^3 and BINOMIAL(A(x)) = B(x)^4 where B(x) = 1 + x + 4*x^2 + 28*x^3 + 286*x^4 + ... is the o.g.f. for A090353. See also A019538. (End)
G.f.: Product_{k>=1} 1/(1 - k*x)^((1/4) * (3/4)^k). - Seiichi Manyama, May 26 2025
a(n) ~ (n-1)! / (4 * log(4/3)^(n+1)). - Vaclav Kotesovec, May 28 2025