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

%I #13 Nov 01 2022 10:36:43

%S 1,2,16,258,6184,195660,7674144,358788696,19464910000,1201543131276,

%T 83134800597280,6371436086078382,535715287899894216,

%U 49025879014213908144,4850781409411286177248,515964243167132532702480,58710263012322890445554400

%N a(n) = Sum_{k=0..n} binomial(n*k,k) * binomial(n*(n-k),n-k).

%H Seiichi Manyama, <a href="/A358145/b358145.txt">Table of n, a(n) for n = 0..337</a>

%F a(n) = Sum_{k=0..n} (n-1)^(n-k) * binomial(n^2+1,k).

%F a(n) = Sum_{k=0..n} n^(n-k) * binomial((n-1)*n+k,k).

%F a(n) ~ exp(n - 1/2) * n^n / 2. - _Vaclav Kotesovec_, Nov 01 2022

%o (PARI) a(n) = sum(k=0, n, binomial(n*k, k)*binomial(n*(n-k), n-k));

%o (PARI) a(n) = sum(k=0, n, (n-1)^(n-k)*binomial(n^2+1, k));

%o (PARI) a(n) = sum(k=0, n, n^(n-k)*binomial((n-1)*n+k, k));

%Y Main diagonal of A358050.

%K nonn

%O 0,2

%A _Seiichi Manyama_, Oct 31 2022

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 September 7 19:53 EDT 2024. Contains 375749 sequences. (Running on oeis4.)