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.

A226534 a(n) = (p(n+1) + p(n) - 1) mod (p(n+1) - p(n) + 1) where p(n) is the n-th prime.

Table of values

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

List of values

[0, 1, 2, 2, 2, 4, 2, 1, 2, 2, 4, 2, 2, 4, 1, 6, 2, 1, 2, 2, 4, 1, 3, 5, 2, 2, 4, 2, 1, 14, 2, 1, 2, 1, 2, 6, 4, 4, 3, 1, 2, 8, 2, 4, 2, 6, 4, 4, 2, 1, 2, 2, 7, 3, 1, 6, 2, 1, 2, 2, 3, 14, 2, 2, 4, 2, 2, 1, 2, 1, 4, 5, 4, 2, 1, 1, 2, 2, 8, 2, 2, 4, 2, 3, 1, 2, 5, 2, 2, 4, 9, 2, 2, 8, 1, 3, 2]