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.

A324341 If 2n = 2^e1 + ... + 2^ek [e1 .. ek distinct], then a(n) is the number of nonzero digits when A002110(e1) * ... * A002110(ek) is written in primorial base.

Table of values

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

List of values

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