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.

A087412 a(n) is the number of solutions to x^3 + y^3 == 1 (mod n).

Table of values

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

List of values

[1, 2, 3, 4, 5, 6, 6, 8, 18, 10, 11, 12, 6, 12, 15, 16, 17, 36, 24, 20, 18, 22, 23, 24, 25, 12, 54, 24, 29, 30, 33, 32, 33, 34, 30, 72, 24, 48, 18, 40, 41, 36, 33, 44, 90, 46, 47, 48, 42, 50, 51, 24, 53, 108, 55, 48, 72, 58, 59, 60]