login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A364747
G.f. A(x) satisfies A(x) = 1 + x*A(x)^4 / (1 - x*A(x)).
10
1, 1, 5, 32, 234, 1854, 15490, 134380, 1198944, 10931761, 101412677, 954155059, 9083120975, 87326765375, 846709605539, 8269910074087, 81291388929027, 803592049667495, 7983612883739843, 79671910265120574, 798283229227457304, 8027625597750959053
OFFSET
0,3
LINKS
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)
PROG
(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
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Aug 05 2023
STATUS
approved