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

A365130 G.f. satisfies A(x) = (1 + x*A(x)*(1 + x*A(x))^2)^3.

Original entry on oeis.org

1, 3, 18, 124, 945, 7650, 64592, 562419, 5013645, 45530725, 419735784, 3917714430, 36949853641, 351597275136, 3371317098546, 32542166997655, 315962469096855, 3083729075615055, 30236064140642514, 297698542934231016, 2942082095638037148
Offset: 0

Views

Author

Seiichi Manyama, Aug 23 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n, s=2, t=3) = sum(k=0, n, binomial(t*(n+1), k)*binomial(s*k, n-k))/(n+1);

Formula

If g.f. satisfies A(x) = (1 + x*A(x)*(1 + x*A(x))^s)^t, then a(n) = (1/(n+1)) * Sum_{k=0..n} binomial(t*(n+1),k) * binomial(s*k,n-k).
Showing 1-1 of 1 results.