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!)
A348321 a(n) = Sum_{k=0..floor(n/2)} (-1)^k * binomial(n*(n-k),n*k). 2
1, 1, 0, -19, -493, -12500, 2110381, 2291797033, 2190576317924, 641690166054149, -51808237792071009216, -1670420776971967146820397, -51706433129693385388017540008, 3622699946475084834038607930411332, 5598748000229343046813449019221837072281 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = [x^(n^2)] (1-x)^(n-1)/((1-x)^n + x^(2*n)) for n > 0.
MATHEMATICA
a[n_] := Sum[(-1)^k * Binomial[n*(n - k), n*k], {k, 0, n}]; Array[a, 15, 0] (* Amiram Eldar, Oct 12 2021 *)
PROG
(PARI) a(n) = sum(k=0, n, (-1)^k*binomial(n*(n-k), n*k));
(PARI) a(n) = if(n==0, 1, polcoef((1-x)^(n-1)/((1-x)^n+x^(2*n)+x*O(x^n^2)), n^2));
CROSSREFS
Sequence in context: A003700 A093975 A159248 * A284220 A201711 A243784
KEYWORD
sign
AUTHOR
Seiichi Manyama, Oct 12 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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)