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!)
A092815 Schmidt's problem sum for r = 5. 6

%I #20 Sep 12 2015 11:00:19

%S 1,33,15553,27748833,61371200001,155741521320033,487874692844719489,

%T 1730097641006678817249,6559621957318406477234689,

%U 26511434186466256434467280033,113203209912753307355868621335553,503697803885283278416185835107071649,2318764463485777975432760948801307487809

%N Schmidt's problem sum for r = 5.

%H Vincenzo Librandi, <a href="/A092815/b092815.txt">Table of n, a(n) for n = 0..200</a>

%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Asymptotic of generalized Apery sequences with powers of binomial coefficients</a>, Nov 04 2012

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SchmidtsProblem.html">Schmidt's Problem</a>

%F a(n) = sum(k=0..n, binomial(n,k)^5 * binomial(n+k,k)^5 ). - corrected by _Vaclav Kotesovec_, Nov 04 2012

%F a(n) ~ (1+sqrt(2))^(5*(2n+1))/(2^(13/4)*(Pi*n)^(9/2)*sqrt(5)). - _Vaclav Kotesovec_, Nov 04 2012

%t Table[Sum[Binomial[n, k]^5 Binomial[n+k, k]^5, {k, 0, n}], {n, 0, 20}] (* _Vaclav Kotesovec_, Nov 04 2012 *)

%o (PARI) a(n)=sum(k=0,n,binomial(n,k)^5*binomial(n+k,k)^5); \\ _Joerg Arndt_, May 11 2013

%Y Cf. A001850, A005259, A092813, A092814, A218689.

%K nonn

%O 0,2

%A _Eric W. Weisstein_, Mar 06 2004

%E Prepended missing a(0)=1, _Joerg Arndt_, May 11 2013

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)