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

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

Original entry on oeis.org

1, 1, 6, 39, 284, 2223, 18267, 155445, 1358073, 12111306, 109802183, 1009001571, 9376972698, 87978198364, 832223905371, 7928413841673, 76002832317437, 732578811761670, 7095717550127526, 69029297500888522, 674181392461483212, 6607910786529613248
Offset: 0

Views

Author

Seiichi Manyama, Nov 11 2023

Keywords

Crossrefs

Programs

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

Formula

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

A367234 G.f. satisfies A(x) = 1 + x*A(x)^2 / (1 - x*A(x))^4.

Original entry on oeis.org

1, 1, 6, 35, 226, 1561, 11276, 84150, 643730, 5021038, 39781858, 319282210, 2590312872, 21208628405, 175024439504, 1454329099044, 12157356271998, 102170610282040, 862721635191860, 7315768816166027, 62274763166575410, 531950072655682896, 4558282056420235664
Offset: 0

Views

Author

Seiichi Manyama, Nov 11 2023

Keywords

Crossrefs

Programs

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

Formula

If g.f. satisfies A(x) = 1 + x*A(x)^t / (1 - x*A(x)^u)^s, then a(n) = Sum_{k=0..n} binomial(t*k+u*(n-k)+1,k) * binomial(n+(s-1)*k-1,n-k) / (t*k+u*(n-k)+1).
From Seiichi Manyama, Dec 01 2024: (Start)
G.f.: exp( Sum_{k>=1} A378567(k) * x^k/k ).
a(n) = (1/(n+1)) * [x^n] 1/(1 - x/(1 - x)^4)^(n+1).
G.f.: (1/x) * Series_Reversion( x*(1 - x/(1 - x)^4) ). (End)
Showing 1-2 of 2 results.