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!)
A360861 a(n) = Sum_{k=0..n} binomial(n, ceiling(k/2)) * binomial(n, floor(k/2)). 2
1, 2, 7, 22, 81, 281, 1058, 3830, 14605, 54127, 208110, 782761, 3027038, 11501478, 44668692, 170974710, 666220005, 2564271875, 10018268150, 38728479647, 151631858378, 588229029258, 2307174835212, 8975958379817, 35258881445606, 137501193282026, 540821096592028 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = (1/2)*(binomial(2*n+1,n)+binomial(n,floor(n/2))^2). - Tani Akinari, Jul 12 2023
MATHEMATICA
A360861[n_]:=(Binomial[2n+1, n]+Binomial[n, Floor[n/2]]^2)/2;
Array[A360861, 30, 0] (* Paolo Xausa, Dec 11 2023 *)
PROG
(Python)
from math import comb
def A360861(n): return sum(comb(n, m:=k>>1)**2*(n-m)//(m+1) for k in range(1, n+1, 2)) + sum(comb(n, k>>1)**2 for k in range(0, n+1, 2)) # Chai Wah Wu, Feb 28 2023
(Maxima) a(n):=(1/2)*(binomial(2*n+1, n)+(binomial(n, floor(n/2)))^2); /* Tani Akinari, Jul 12 2023 */
CROSSREFS
Row sums of A360859.
Sequence in context: A047095 A110137 A097967 * A052879 A007867 A241156
KEYWORD
nonn
AUTHOR
Peter Luschny, Feb 28 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 August 26 11:44 EDT 2024. Contains 375456 sequences. (Running on oeis4.)