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.

A084199 Smallest prime q < prime(n) such that q+1 divides prime(n)+1, a(n) = 1 if no such q exists.

Table of values

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

List of values

[1, 1, 2, 3, 2, 1, 2, 3, 2, 2, 3, 1, 2, 3, 2, 2, 2, 1, 3, 2, 1, 3, 2, 2, 13, 2, 3, 2, 1, 2, 3, 2, 2, 3, 2, 3, 1, 3, 2, 2, 2, 13, 2, 1, 2, 3, 3, 3, 2, 1, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 3, 2, 3, 2, 1, 2, 3, 1, 2, 13, 2, 2, 3, 1, 3, 2, 2, 1, 2, 1, 2, 1, 2, 13, 3, 2, 2, 1, 2, 3, 2, 2, 3, 2, 3, 2, 2, 2, 3, 1, 3, 2, 2]