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.

A348168 Segment the list of prime numbers into sublists L_1, L_2, ... with L_1 = {2} and L_n = {p_1, p_2, ..., p_a(n)}, where a(n) is the largest m such that for 0 < i < m, p_1 - prevprime(p_1) > p_2 - p_1 >= p_{i+1} - p_i.

Table of values

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

List of values

[1, 1, 1, 1, 2, 2, 1, 2, 4, 1, 2, 3, 2, 1, 6, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 4, 2, 8, 1, 4, 2, 2, 1, 1, 5, 2, 1, 2, 2, 2, 1, 4, 6, 2, 2, 5, 8, 7, 2, 1, 1, 2, 10, 2, 2, 2, 2, 1, 4, 4, 2, 1, 5, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 1, 4, 1, 1, 3, 2, 2, 3, 1, 2, 1, 2, 1, 2]