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.

A007998 Number of primitive solutions to x + y + z = 0 (mod n).

Table of values

n a(n)
1 1
2 2
3 3
4 3
5 4
6 5
7 5
8 7
9 8
10 9
11 9
12 15
13 11
14 17
15 17
16 18
17 18
18 31
19 21
20 33
21 30
22 33
23 30
24 53
25 34
26 48
27 46
28 53
29 43
30 87
31 47
32 73
33 69
34 79
35 66
36 110
37 65
38 100
39 94
40 111
41 80
42 159
43 86
44 135
45 130
46 135
47 108
48 202
49 116
50 181
51 153
52 175
53 133
54 255
55 150
56 212

List of values

[1, 2, 3, 3, 4, 5, 5, 7, 8, 9, 9, 15, 11, 17, 17, 18, 18, 31, 21, 33, 30, 33, 30, 53, 34, 48, 46, 53, 43, 87, 47, 73, 69, 79, 66, 110, 65, 100, 94, 111, 80, 159, 86, 135, 130, 135, 108, 202, 116, 181, 153, 175, 133, 255, 150, 212]