The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A364336 G.f. satisfies A(x) = (1 + x) * (1 + x*A(x)^3). 12
1, 2, 7, 39, 242, 1634, 11631, 85957, 653245, 5072862, 40077807, 321106623, 2602911282, 21308131235, 175909559897, 1462846379247, 12242600576066, 103035285071630, 871490142773640, 7404121610615520, 63157400073057627, 540689217572662413, 4644083121177225292 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = Sum_{k=0..n} binomial(3*k+1,k) * binomial(3*k+1,n-k) / (3*k+1).
D-finite with recurrence -2*n*(2*n+1)*a(n) +(3*n^2+23*n-14)*a(n-1) +(207*n^2 -635*n +494)*a(n-2) +2*(397*n^2 -2031*n +2600)*a(n-3) +6*(75*n-244) *(3*n-11)*a(n-4) +9*(45*n-179) *(3*n-14)*a(n-5) +63*(3*n-14) *(3*n-17)*a(n-6) +12*(3*n-16) *(3*n-20)*a(n-7)=0. - R. J. Mathar, Jul 25 2023
MAPLE
A364336 := proc(n)
add( binomial(3*k+1, k) * binomial(3*k+1, n-k)/(3*k+1), k=0..n) ;
end proc:
seq(A364336(n), n=0..80); # R. J. Mathar, Jul 25 2023
MATHEMATICA
nmax = 80; A[_] = 1;
Do[A[x_] = (1 + x)*(1 + x*A[x]^3) + O[x]^(nmax+1) // Normal, {nmax+1}];
CoefficientList[A[x], x] (* Jean-François Alcover, Mar 03 2024 *)
PROG
(PARI) a(n) = sum(k=0, n, binomial(3*k+1, k)*binomial(3*k+1, n-k)/(3*k+1));
CROSSREFS
Sequence in context: A121752 A054133 A330470 * A266310 A032118 A369087
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jul 19 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 03:14 EDT 2024. Contains 372549 sequences. (Running on oeis4.)