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.

A353283 Minimum number of numbers to drop to determine whether n is a prime number using the Sieve of Eratosthenes algorithm.

Table of values

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

List of values

[0, 0, 1, 1, 2, 2, 3, 4, 4, 5, 5, 6, 6, 8, 7, 9, 8, 10, 9, 12, 10, 13, 11, 15, 12, 16, 13, 18, 14, 19, 15, 20, 16, 23, 17, 24, 18, 24, 19, 27, 20, 28, 21, 28, 22, 31, 23, 33, 24, 32, 25, 36, 26, 37, 27, 36, 28, 41, 29, 42, 30, 40, 31, 45, 32, 47, 33, 44, 34, 50, 35, 51, 36, 48]