cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A032801 Number of unordered sets a, b, c, d of distinct integers from 1..n such that a+b+c+d = 0 (mod n).

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 3
7 5
8 9
9 14
10 22
11 30
12 42
13 55
14 73
15 91
16 115
17 140
18 172
19 204
20 244
21 285
22 335
23 385
24 445
25 506
26 578
27 650
28 734
29 819
30 917
31 1015
32 1127
33 1240
34 1368
35 1496
36 1640
37 1785
38 1947
39 2109
40 2289
41 2470
42 2670
43 2870
44 3090
45 3311
46 3553
47 3795
48 4059
49 4324
50 4612
51 4900
52 5212
53 5525

List of values

[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, 3311, 3553, 3795, 4059, 4324, 4612, 4900, 5212, 5525]