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.

A284257 a(n) = number of prime factors of n that are < the square of smallest prime factor of n (counted with multiplicity), a(1) = 0.

Table of values

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

List of values

[0, 1, 1, 2, 1, 2, 1, 3, 2, 1, 1, 3, 1, 1, 2, 4, 1, 3, 1, 2, 2, 1, 1, 4, 2, 1, 3, 2, 1, 2, 1, 5, 1, 1, 2, 4, 1, 1, 1, 3, 1, 2, 1, 2, 3, 1, 1, 5, 2, 1, 1, 2, 1, 4, 2, 3, 1, 1, 1, 3, 1, 1, 3, 6, 2, 2, 1, 2, 1, 1, 1, 5, 1, 1, 3, 2, 2, 2, 1, 4, 4, 1, 1, 3, 2, 1, 1, 3, 1, 3, 2, 2, 1, 1, 2, 6, 1, 1, 2, 2, 1, 2, 1, 3, 3, 1, 1, 5, 1, 1, 1, 4, 1, 2, 2, 2, 2, 1, 2, 4]