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.

A215486 n - 1 mod phi(n), where phi(n) is Euler's totient function.

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 0, 3, 2, 1, 0, 3, 0, 1, 6, 7, 0, 5, 0, 3, 8, 1, 0, 7, 4, 1, 8, 3, 0, 5, 0, 15, 12, 1, 10, 11, 0, 1, 14, 7, 0, 5, 0, 3, 20, 1, 0, 15, 6, 9, 18, 3, 0, 17, 14, 7, 20, 1, 0, 11, 0, 1, 26, 31, 16, 5, 0, 3, 24, 21, 0, 23, 0, 1, 34, 3, 16, 5, 0, 15, 26, 1, 0, 11, 20, 1, 30, 7, 0, 17]