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!)
A342294 a(n) = Sum_{k = 0..n} binomial(n,k)^11. 12
1, 2, 2050, 354296, 371185666, 200097656252, 222100237312864, 193798873701831680, 231719476114879600642, 257097895846251291074612, 330463219813679264204224300, 419460465362069257397304825200, 573863850341313751827291703127200 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
M. A. Perlstadt, Some Recurrences for Sums of Powers of Binomial Coefficients, Journal of Number Theory 27 (1987), pp. 304-309.
FORMULA
a(n) ~ 2^(p*n)/sqrt(p) * (2/(Pi*n))^((p-1)/2) * (1 - (p-1)^2/(4*p*n)), set p=11. - Vaclav Kotesovec, Aug 04 2022
PROG
(PARI) a(n) = sum(k=0, n, binomial(n, k)^11); \\ Michel Marcus, Mar 27 2021
CROSSREFS
Column 11 of A309010.
Sum_{k = 0..n} C(n,k)^m for m = 1..12: A000079, A000984, A000172, A005260, A005261, A069865, A182421, A182422, A182446, A182447, A342294, A342295.
Sequence in context: A004908 A275002 A004813 * A089981 A368480 A365179
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 27 2021
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 May 8 19:26 EDT 2024. Contains 372341 sequences. (Running on oeis4.)