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!)
A371743 a(n) = Sum_{k=0..floor(n/2)} binomial(4*n-k,n-2*k). 3
1, 4, 29, 231, 1926, 16491, 143683, 1267395, 11282393, 101151544, 912011633, 8260998772, 75115815749, 685232639419, 6268299350776, 57478389714473, 528167137069958, 4862304525663579, 44836026545219765, 414048025058547788, 3828677665694353049 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = [x^n] 1/((1-x-x^2) * (1-x)^(3*n)).
a(n) ~ 2^(8*n + 5/2) / (11 * sqrt(Pi*n) * 3^(3*n - 1/2)). - Vaclav Kotesovec, Apr 05 2024
PROG
(PARI) a(n) = sum(k=0, n\2, binomial(4*n-k, n-2*k));
CROSSREFS
Sequence in context: A087809 A140526 A151343 * A208812 A291103 A125808
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 June 22 05:36 EDT 2024. Contains 373565 sequences. (Running on oeis4.)