The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A242446 a(n) = Sum_{k=1..n} C(n,k) * k^(2*n). 8
1, 18, 924, 93320, 15609240, 3903974592, 1364509038592, 635177480713344, 379867490829555840, 283825251434680651520, 259092157573229145859584, 283735986144895532781391872, 367138254141051794797009309696, 554136240038549806366753446051840 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Generally, for p>=1, a(n) = Sum_{k=1..n} C(n,k) * k^(p*n) is asymptotic to sqrt(r/(p+r-p*r)) * r^(p*n) * n^(p*n) / (exp(p*n) * (1-r)^n), where r = p/(p+LambertW(p*exp(-p))).
Sum_{k=1..n} (-1)^(n-k) * C(n,k) * k^(p*n) = n! * stirling2(p*n,n).
LINKS
FORMULA
a(n) ~ sqrt(r/(2-r)) * r^(2*n) * n^(2*n) / (exp(2*n) * (1-r)^n), where r = 2/(2+LambertW(2*exp(-2))).
MATHEMATICA
Table[Sum[Binomial[n, k]*k^(2*n), {k, 1, n}], {n, 1, 20}]
CROSSREFS
Sequence in context: A215194 A201538 A214160 * A160013 A356687 A123786
KEYWORD
nonn,easy
AUTHOR
Vaclav Kotesovec, May 14 2014
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 June 3 23:31 EDT 2024. Contains 373088 sequences. (Running on oeis4.)