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.

A096197 a(n) = (1+prime(n)) mod n.

Table of values

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

List of values

[0, 0, 0, 0, 2, 2, 4, 4, 6, 0, 10, 2, 3, 2, 3, 6, 9, 8, 11, 12, 11, 14, 15, 18, 23, 24, 23, 24, 23, 24, 4, 4, 6, 4, 10, 8, 10, 12, 12, 14, 16, 14, 20, 18, 18, 16, 24, 32, 32, 30, 30, 32, 30, 36, 38, 40, 42, 40, 42, 42, 40, 46, 56, 56, 54, 54, 64, 66, 3, 0, 70, 0, 3, 4, 5, 4, 5, 8, 7, 10, 15]