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!)
A129368 a(n) = Sum_{k=floor((n+1)/2)..n} binomial(2*k,k). 2

%I #10 Jan 31 2024 15:09:00

%S 1,2,8,26,96,342,1266,4678,17548,66098,250854,956034,3660190,14059866,

%T 54176466,209290554,810370944,3143964294,12219099594,47564314774,

%U 185410843594,723668533278,2827767496998,11061197519166

%N a(n) = Sum_{k=floor((n+1)/2)..n} binomial(2*k,k).

%C Partial sums of A129369.

%H G. C. Greubel, <a href="/A129368/b129368.txt">Table of n, a(n) for n = 0..1000</a>

%F G.f.: (1/(1-x))*( 1/sqrt(1-4*x) - x/sqrt(1-4*x^2) ).

%F a(n) = Sum_{k=0..floor(n/2)} C(2*(n-k), n-k).

%t Table[Sum[Binomial[2k,k],{k,Floor[(n+1)/2],n}],{n,0,30}] (* _Harvey P. Dale_, Aug 13 2012 *)

%o (Magma) [(&+[Binomial(2*(n-k),n-k): k in [0..Floor(n/2)]]): n in [0..60]]; // _G. C. Greubel_, Jan 31 2024

%o (SageMath) [sum(binomial(2*(n-k),n-k) for k in range(1+(n//2))) for n in range(61)] # _G. C. Greubel_, Jan 31 2024

%Y Cf. A129369.

%K easy,nonn

%O 0,2

%A _Paul Barry_, Apr 11 2007

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 21:04 EDT 2024. Contains 372287 sequences. (Running on oeis4.)