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.

A240231 Number of factors needed in the unique factorization of positive integers into terms of A186285 where any term is used at most twice.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 3, 2, 2, 1, 2, 2, 2, 1, 3, 1, 3, 1, 3, 2, 2, 2, 4, 1, 2, 2, 2, 1, 3, 1, 3, 3, 2, 1, 3, 2, 3, 2, 3, 1, 2, 2, 2, 2, 2, 1, 4, 1, 2, 3, 2, 2, 3, 1, 3, 2, 3, 1, 3, 1, 2, 3, 3, 2, 3, 1, 3, 2, 2, 1, 4, 2, 2, 2, 2, 1, 4, 2, 3, 2, 2, 2, 4, 1, 3, 3, 4, 1, 3, 1, 2, 3]