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.

A169611 Number of prime divisors of n that are not greater than 3, counted with multiplicity.

Table of values

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

List of values

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