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.

A052180 Last filtering prime for n-th prime p: find smallest prime factor of each of the composite numbers between p and next prime; take maximal value.

Table of values

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

List of values

[2, 2, 3, 2, 3, 2, 3, 5, 2, 5, 3, 2, 3, 7, 5, 2, 5, 3, 2, 7, 3, 5, 7, 3, 2, 3, 2, 3, 11, 3, 7, 2, 11, 2, 5, 7, 3, 13, 5, 2, 11, 2, 3, 2, 11, 13, 3, 2, 3, 5, 2, 13, 11, 7, 5, 2, 5, 3, 2, 17, 13, 3, 2, 3, 17, 5, 11, 2, 3, 5, 19, 7, 13, 3, 5, 17, 3, 13, 7, 2, 7, 2, 19, 3, 5, 11, 3, 2, 3, 11, 13, 3, 17]