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.

A087611 a(n) = (prime(n) - 1) mod n.

Table of values

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

List of values

[0, 0, 1, 2, 0, 0, 2, 2, 4, 8, 8, 0, 1, 0, 1, 4, 7, 6, 9, 10, 9, 12, 13, 16, 21, 22, 21, 22, 21, 22, 2, 2, 4, 2, 8, 6, 8, 10, 10, 12, 14, 12, 18, 16, 16, 14, 22, 30, 30, 28, 28, 30, 28, 34, 36, 38, 40, 38, 40, 40, 38, 44, 54, 54, 52, 52, 62, 64, 1, 68, 68, 70, 1, 2, 3, 2, 3, 6, 5, 8]