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.

A048259 Number of distinct solutions to x + y + z = 0 (mod n), where two solutions are equivalent if one can be obtained from the other by multiplying by units in Z/nZ and permuting x,y,z.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 3
6 7
7 4
8 8
9 6
10 8
11 4
12 15
13 5
14 10
15 11
16 14
17 5
18 17
19 6
20 18
21 14
22 12
23 6
24 31
25 9
26 14
27 13
28 22
29 7
30 33
31 8
32 24
33 16
34 16
35 16
36 39
37 9
38 18
39 19
40 38
41 9
42 41
43 10
44 28
45 28
46 20
47 10
48 57
49 15
50 30
51 21
52 32
53 11
54 43
55 20
56 46
57 24
58 24
59 12
60 77
61 13
62 26
63 35
64 42
65 23
66 53
67 14
68 38
69 26
70 52
71 14
72 83

List of values

[1, 1, 2, 3, 4, 3, 7, 4, 8, 6, 8, 4, 15, 5, 10, 11, 14, 5, 17, 6, 18, 14, 12, 6, 31, 9, 14, 13, 22, 7, 33, 8, 24, 16, 16, 16, 39, 9, 18, 19, 38, 9, 41, 10, 28, 28, 20, 10, 57, 15, 30, 21, 32, 11, 43, 20, 46, 24, 24, 12, 77, 13, 26, 35, 42, 23, 53, 14, 38, 26, 52, 14, 83]