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!)
A349480 a(n) = Sum_{j=0..n} (-1)^(n-j) * Product_{k=(j-1)*n+1..j*n} k. 2
1, 1, 10, 390, 33456, 4845360, 1059099840, 325460948400, 133697543616000, 70733019878196480, 46831083260349024000, 37927830201482962540800, 36883442511877368877747200, 42409212946187708288828160000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = n! * A349470(n) = n! * Sum_{k=0..n} (-1)^(n-k) * binomial(k*n,n).
EXAMPLE
a(2) = -1*2 + 3*4 = 10.
a(3) = 1*2*3 - 4*5*6 + 7*8*9 = 390.
a(4) = -1*2*3*4 + 5*6*7*8 - 9*10*11*12 + 13*14*15*16 = 33456.
MATHEMATICA
a[n_] := n! * Sum[(-1)^(n - k) * Binomial[k*n, n], {k, 0, n}]; Array[a, 14, 0] (* Amiram Eldar, Nov 19 2021 *)
PROG
(PARI) a(n) = sum(j=0, n, (-1)^(n-j)*prod(k=(j-1)*n+1, j*n, k));
CROSSREFS
Sequence in context: A000591 A131312 A055733 * A203774 A024136 A222851
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Nov 19 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 April 16 03:28 EDT 2024. Contains 371696 sequences. (Running on oeis4.)