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!)
A371870 a(n) = Sum_{k=0..floor(n/2)} binomial(2*n-k-1,n-2*k). 1
1, 1, 4, 14, 51, 189, 709, 2683, 10220, 39130, 150438, 580328, 2245004, 8705686, 33828704, 131688362, 513445147, 2004688605, 7836832057, 30670416703, 120153739079, 471143251989, 1848978071615, 7261781367389, 28540427527441, 112243216215879, 441693646453729 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = [x^n] 1/((1-x-x^2) * (1-x)^(n-1)).
a(n) ~ 4^n / sqrt(Pi*n). - Vaclav Kotesovec, Apr 16 2024
a(n) = A354267(2*n, n). - Peter Luschny, Apr 25 2024
PROG
(PARI) a(n) = sum(k=0, n\2, binomial(2*n-k-1, n-2*k));
CROSSREFS
Sequence in context: A211303 A247415 A292463 * A149488 A058692 A165813
KEYWORD
nonn,changed
AUTHOR
Seiichi Manyama, Apr 10 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 April 30 23:08 EDT 2024. Contains 372141 sequences. (Running on oeis4.)