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!)
A358145 a(n) = Sum_{k=0..n} binomial(n*k,k) * binomial(n*(n-k),n-k). 2
1, 2, 16, 258, 6184, 195660, 7674144, 358788696, 19464910000, 1201543131276, 83134800597280, 6371436086078382, 535715287899894216, 49025879014213908144, 4850781409411286177248, 515964243167132532702480, 58710263012322890445554400 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = Sum_{k=0..n} (n-1)^(n-k) * binomial(n^2+1,k).
a(n) = Sum_{k=0..n} n^(n-k) * binomial((n-1)*n+k,k).
a(n) ~ exp(n - 1/2) * n^n / 2. - Vaclav Kotesovec, Nov 01 2022
PROG
(PARI) a(n) = sum(k=0, n, binomial(n*k, k)*binomial(n*(n-k), n-k));
(PARI) a(n) = sum(k=0, n, (n-1)^(n-k)*binomial(n^2+1, k));
(PARI) a(n) = sum(k=0, n, n^(n-k)*binomial((n-1)*n+k, k));
CROSSREFS
Main diagonal of A358050.
Sequence in context: A140307 A114039 A090305 * A246739 A304317 A351918
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Oct 31 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 05:49 EDT 2024. Contains 371918 sequences. (Running on oeis4.)