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!)
A371758 a(n) = Sum_{k=0..floor(n/3)} binomial(2*n-3*k-1,n-3*k). 6
1, 1, 3, 11, 39, 141, 519, 1933, 7263, 27479, 104543, 399543, 1532779, 5899167, 22766607, 88073091, 341425551, 1326019653, 5158412943, 20096457549, 78396460299, 306190920837, 1197181197567, 4685523856881, 18354865147011, 71962695111841, 282357198103815 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = [x^n] 1/((1-x^3) * (1-x)^n).
a(n) = binomial(2*n-1, n)*hypergeom([1, (1-n)/3, (2-n)/3, -n/3], [(1-2*n)/3, 2*(1-n)/3, 1-2*n/3], 1). - Stefano Spezia, Apr 06 2024
From Vaclav Kotesovec, Apr 08 2024: (Start)
Recurrence: 3*n*(7*n-11)*a(n) = 6*(2*n-3)*(7*n-4)*a(n-1) - n*(7*n-11)*a(n-2) + 2*(2*n-3)*(7*n-4)*a(n-3).
a(n) ~ 2^(2*n+2) / (7*sqrt(Pi*n)). (End)
PROG
(PARI) a(n) = sum(k=0, n\3, binomial(2*n-3*k-1, n-3*k));
CROSSREFS
Sequence in context: A007482 A134760 A257290 * A281482 A132889 A245390
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Apr 05 2024
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 5 05:35 EDT 2024. Contains 372257 sequences. (Running on oeis4.)