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.

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

Original entry on oeis.org

1, 1, 4, 19, 107, 648, 4144, 27500, 187654, 1308361, 9280049, 66749995, 485741501, 3569653591, 26454406231, 197482954338, 1483619134872, 11208536870979, 85101381927454, 649017399223259, 4969510058193925, 38189305411228229, 294440263583908772
Offset: 0

Views

Author

Seiichi Manyama, Nov 12 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n, s=3, t=1, u=3) = sum(k=0, n, binomial(t*k+u*(n-k)+1, k)*binomial(s*k, 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(s*k,n-k) / (t*k+u*(n-k)+1).

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

Original entry on oeis.org

1, 1, 5, 26, 159, 1042, 7185, 51340, 376806, 2823734, 21516113, 166196703, 1298413089, 10241803340, 81454834164, 652465062453, 5259084437170, 42624217133130, 347160390473763, 2839928983316595, 23323730673818467, 192237734035157372, 1589602164422747636
Offset: 0

Views

Author

Seiichi Manyama, Nov 12 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n, s=3, t=2, u=2) = sum(k=0, n, binomial(t*k+u*(n-k)+1, k)*binomial(s*k, 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(s*k,n-k) / (t*k+u*(n-k)+1).
Showing 1-2 of 2 results.