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.

A109831 Greatest number of primes < prime(n) forming an arithmetic progression such that also prime(n) is a term.

Table of values

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

List of values

[1, 1, 2, 2, 1, 2, 2, 3, 4, 2, 1, 3, 3, 2, 4, 3, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 4, 4, 2, 3, 3, 3, 5, 3, 3, 4, 2, 3, 3, 3, 4, 3, 2, 3, 4, 3, 3, 3, 3, 4, 5, 3, 3, 4, 2, 3, 4, 4, 3, 5, 3, 3, 3, 2, 3, 3, 5, 3, 3, 4, 2, 3, 4, 4, 3, 3, 3, 4, 3, 3, 3, 4, 4, 3, 3, 5, 3, 4, 3, 3, 2, 3, 5, 4, 3, 3, 3, 2, 3]