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.

A160650 a(n) = A001222(A160649(n)) = A160649(n+1) - A160649(n); where A001222(m) is the sum of prime-factorization exponents of m (or, A001222(m) is the number of primes dividing m, counted with multiplicity).

Table of values

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

List of values

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