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.

A376757 Number of pairs 0 <= x <= y <= n-1 such that x^3 == y^3 (mod n).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 5
6 6
7 13
8 14
9 18
10 10
11 11
12 15
13 25
14 26
15 15
16 28
17 17
18 36
19 37
20 25
21 39
22 22
23 23
24 42
25 35
26 50
27 81
28 71
29 29
30 30
31 61
32 72
33 33
34 34
35 65
36 99
37 73
38 74
39 75
40 70
41 41
42 78
43 85
44 55
45 90
46 46
47 47
48 84
49 112
50 70
51 51
52 137
53 53
54 162
55 55
56 218
57 111
58 58
59 59
60 75
61 121
62 122
63 288
64 208
65 125
66 66
67 133
68 85
69 69
70 130
71 71
72 306
73 145
74 146
75 105
76 203
77 143
78 150
79 157

List of values

[1, 2, 3, 5, 5, 6, 13, 14, 18, 10, 11, 15, 25, 26, 15, 28, 17, 36, 37, 25, 39, 22, 23, 42, 35, 50, 81, 71, 29, 30, 61, 72, 33, 34, 65, 99, 73, 74, 75, 70, 41, 78, 85, 55, 90, 46, 47, 84, 112, 70, 51, 137, 53, 162, 55, 218, 111, 58, 59, 75, 121, 122, 288, 208, 125, 66, 133, 85, 69, 130, 71, 306, 145, 146, 105, 203, 143, 150, 157]