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.

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

Table of values

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

List of values

[0, 0, 1, 2, 5, 6, 1, 1, 3, 7, 7, 11, 13, 13, 15, 2, 5, 4, 7, 8, 7, 10, 11, 14, 19, 20, 19, 20, 19, 20, 31, 32, 1, 34, 5, 3, 5, 7, 7, 9, 11, 9, 15, 13, 13, 11, 19, 27, 27, 25, 25, 27, 25, 31, 33, 35, 37, 35, 37, 37, 35, 41, 51, 51, 49, 49, 59, 61, 67, 65, 65, 67]