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.

A373813 a(n) is the smallest number of straight lines needed to intersect all points (k, prime(k)) for k = 1..n.

Table of values

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

List of values

[1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15]