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.

A378883 G.f. A(x) satisfies A(x) = 1 + x*A(x)^3/(1 - x*A(x)^5).

Original entry on oeis.org

1, 1, 4, 24, 171, 1338, 11109, 96100, 856762, 7816616, 72627241, 684859147, 6537520290, 63050669143, 613441446154, 6013687144000, 59343220508344, 589004488233064, 5876204912724812, 58893312496308755, 592682966496901253, 5986771171677305889, 60677419447552591497
Offset: 0

Views

Author

Seiichi Manyama, Dec 09 2024

Keywords

Crossrefs

Cf. A378882.

Programs

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

Formula

G.f. A(x) satisfies A(x) = 1/(1 - x*A(x)^2/(1 - x*A(x)^5)).
If g.f. satisfies A(x) = ( 1 + x*A(x)^(t/r) / (1 - x*A(x)^(u/r))^s )^r, then a(n) = r * Sum_{k=0..n} binomial(t*k+u*(n-k)+r,k) * binomial(n+(s-1)*k-1,n-k)/(t*k+u*(n-k)+r).