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.

A077480 Total number of prime factors of numbers m with bigomega(m) == 0 modulo omega(m) (counted with repetition).

Table of values

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

List of values

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