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.

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

Original entry on oeis.org

1, 2, 9, 44, 240, 1386, 8346, 51802, 329086, 2129330, 13984095, 92974510, 624568680, 4232731050, 28904102829, 198688337014, 1373763563150, 9547516671684, 66660156446189, 467342635522698, 3288691828900768, 23220922841177476, 164465227646878689
Offset: 0

Views

Author

Seiichi Manyama, Aug 23 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n, s=2, t=2) = 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.