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.

A091373 Number of numbers <= n having exactly as many prime factors as the value of their smallest prime factor.

Table of values

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

List of values

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