login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A296771 Row sums of A050157. 2

%I

%S 1,3,13,58,257,1126,4882,20980,89497,379438,1600406,6720748,28117498,

%T 117254268,487589572,2022568168,8371423177,34581780478,142605399982,

%U 587138954428,2413944555742,9911778919348,40650232625212,166534680737368,681576405563722

%N Row sums of A050157.

%H Robert Israel, <a href="/A296771/b296771.txt">Table of n, a(n) for n = 0..1657</a>

%F a(n) = Sum_{k=0..n} (binomial(2*n, n) - binomial(2*n, n+k+1)).

%F a(n) = 2^(2*n-1)*(((n-1/2)!*(2*n+3))/(sqrt(Pi)*n!) - 1).

%F a(n) ~ 4^n*(sqrt(n/Pi) - 1/2).

%F a(n) = A037965(n+1) - A000346(n-1) for n >= 1.

%F From _Robert Israel_, Dec 21 2017: (Start)

%F a(n) = (n+3/2)*binomial(2*n,n) - 2^(2*n-1).

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

%F 64*(n+1)*(2*n+1)*a(n)-8*(2*n+3)*(5*n+4)*a(n+1)+2*(n+2)*(8*n+11)*a(n+2)-(n+3)*(n+2)*a(n+3)=0. (End)

%p A296771 := n -> add(binomial(2*n, n) - binomial(2*n, n+k+1), k=0..n):

%p seq(A296771(n), n=0..24);

%t a[n_] := 4^n ((n - 1/2)! (2 n + 3)/(2 Sqrt[Pi] n!) - 1/2);

%t Table[a[n], {n, 0, 24}]

%o (PARI) a(n) = sum(k=0, n, binomial(2*n, n) - binomial(2*n, n+k+1)) \\ _Iain Fox_, Dec 21 2017

%Y Cf. A000346, A037965, A050157, A296770.

%K nonn

%O 0,2

%A _Peter Luschny_, Dec 21 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 01:32 EDT 2020. Contains 337291 sequences. (Running on oeis4.)