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

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

Original entry on oeis.org

1, 1, 6, 47, 424, 4159, 43097, 464197, 5145475, 58313310, 672598269, 7869856070, 93183973405, 1114471042413, 13443614108307, 163372291277764, 1998239045199623, 24580340878055298, 303893356012560280, 3774099648814193998, 47061518776483143441
Offset: 0

Views

Author

Seiichi Manyama, Aug 05 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n) = if(n==0, 1, sum(k=0, n-1, binomial(n, k)*binomial(5*n-4*k, n-1-k))/n);
    
  • PARI
    a(n, r=1, s=1, t=5, u=1) = 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)); \\ Seiichi Manyama, Dec 05 2024

Formula

a(n) = (1/n) * Sum_{k=0..n-1} binomial(n,k) * binomial(5*n-4*k,n-1-k) for n > 0.
From Seiichi Manyama, Dec 05 2024: (Start)
G.f. A(x) satisfies A(x) = 1/(1 - x*A(x)^4/(1 - x*A(x))).
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). (End)

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

Original entry on oeis.org

1, 1, 5, 32, 234, 1854, 15490, 134380, 1198944, 10931761, 101412677, 954155059, 9083120975, 87326765375, 846709605539, 8269910074087, 81291388929027, 803592049667495, 7983612883739843, 79671910265120574, 798283229227457304, 8027625597750959053
Offset: 0

Views

Author

Seiichi Manyama, Aug 05 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n) = if(n==0, 1, sum(k=0, n-1, binomial(n, k)*binomial(4*n-3*k, n-1-k))/n);
    
  • PARI
    a(n, r=1, s=1, t=4, u=1) = 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)); \\ Seiichi Manyama, Dec 05 2024

Formula

a(n) = (1/n) * Sum_{k=0..n-1} binomial(n,k) * binomial(4*n-3*k,n-1-k) for n > 0.
From Seiichi Manyama, Dec 05 2024: (Start)
G.f. A(x) satisfies A(x) = 1/(1 - x*A(x)^3/(1 - x*A(x))).
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). (End)

A378692 G.f. A(x) satisfies A(x) = 1 + x*A(x)^7/(1 - x*A(x)).

Original entry on oeis.org

1, 1, 8, 86, 1075, 14667, 211799, 3182454, 49243854, 779379652, 12558073022, 205312307834, 3397359326116, 56790504859929, 957574385205771, 16267419813629731, 278162968238908681, 4783813617177604232, 82691541747420586716, 1435895455224032519430, 25035634270828781060188
Offset: 0

Views

Author

Seiichi Manyama, Dec 04 2024

Keywords

Crossrefs

Programs

  • PARI
    a(n, r=1, s=1, t=7, u=1) = 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)^6/(1 - x*A(x))).
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).
Showing 1-3 of 3 results.