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!)
A323217 a(n) = hypergeometric([-n, n + 1], [-n - 1], n + 1). 2

%I #14 Feb 26 2019 03:58:08

%S 1,3,25,413,10746,387607,17981769,1022586105,68964092542,

%T 5384626548491,477951767068986,47546350648784341,5240644323742274500,

%U 634033030117301108127,83540992651137240168361,11908866726507685451458545

%N a(n) = hypergeometric([-n, n + 1], [-n - 1], n + 1).

%F a(n) = A323206(n+1, n).

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

%F a(n) = Sum_{j=0..n} binomial(n+j, n)*(1 - j/(n + 1))*(n + 1)^j.

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

%F a(n) = (1/(2*Pi))*Integral_{x=0..4*(n+1)} (sqrt(x*(4*(n+1)-x))*x^n)/(1+n*x).

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

%p # The function ballot is defined in A238762.

%p a := n -> add(ballot(2*j, 2*n)*(n+1)^j, j=0..n):

%p seq(a(n), n=0..16);

%t a[n_] := Hypergeometric2F1[-n, n + 1, -n - 1, n + 1];

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

%Y Cf. A323206, A238762.

%K nonn

%O 0,2

%A _Peter Luschny_, Feb 25 2019

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 15 08:18 EDT 2024. Contains 375173 sequences. (Running on oeis4.)