|
Search: id:A032801
|
|
|
| A032801 |
|
Number of unordered sets a,b,c,d of distinct integers from 1..n such that a+b+c+d=0 (mod n). |
|
+0
1
|
|
| 0, 0, 0, 0, 1, 3, 5, 9, 14, 22, 30, 42, 55, 73, 91, 115, 140, 172, 204, 244, 285, 335, 385, 445, 506, 578, 650, 734, 819, 917, 1015, 1127, 1240, 1368, 1496, 1640, 1785, 1947, 2109, 2289, 2470, 2670, 2870, 3090
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
REFERENCES
|
Barnes, Acta Arith., 5 (1958), p. 65.
E. V. McLaughlin, Numbers of factorizations in non-unique factorial domains, Senior Thesis, Allegeny College, Meadville, PA, April 2004.
|
|
MAPLE
|
f := n-> if n mod 2 <> 0 then (n-1)*(n-2)*(n-3)/24 elif n mod 4 = 0 then (n-4)*(n^2-2*n+6)/24 else (n-2)*(n^2-4*n+6)/24; fi;
|
|
CROSSREFS
|
Sequence in context: A054066 A081946 A053618 this_sequence A033818 A120452 A061556
Adjacent sequences: A032798 A032799 A032800 this_sequence A032802 A032803 A032804
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
