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!)
A358495 a(n) = Sum_{k=0..n} binomial(binomial(n, k), n). 1
1, 2, 1, 2, 17, 506, 48772, 13681602, 12287555282, 33669343492094, 311704008906073448, 9309805333008203501246, 987309241535765332024955809, 351345748109942610415182510895442, 459648902729700156671704473390158212154, 2067884865276847662816755891452805155809167114 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) ~ c * binomial(binomial(n, n/2), n), where c = EllipticTheta[3,0,1/E^2] = JacobiTheta3(0,exp(-2)) = A218792 = 1.271341522189... if n is even and c = EllipticTheta[2,0,1/E^2] = JacobiTheta2(0,exp(-2)) = 1.23528676585389... if n is odd.
Equivalently, a(n) ~ c * 2^(n^2 + n/2 - 1/2) * exp(n - 1/4) / (Pi^((n+1)/2) * n^((3*n+1)/2)).
MATHEMATICA
Table[Sum[Binomial[Binomial[n, k], n], {k, 0, n}], {n, 0, 16}]
PROG
(PARI) a(n) = sum(k=0, n, binomial(binomial(n, k), n)); \\ Michel Marcus, Nov 19 2022
CROSSREFS
Sequence in context: A251731 A058260 A202410 * A271225 A349563 A115507
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Nov 19 2022
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 April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)