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.

A052299 Minimal number of distinct prime factors of any composite number between n-th and (n+1)-st primes.

Table of values

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

List of values

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