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.

A324342 If 2n = 2^e1 + ... + 2^ek [e1 .. ek distinct], then a(n) is the minimal number of primorials (A002110) that add to A002110(e1) * ... * A002110(ek).

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 6, 6, 1, 2, 6, 2, 10, 10, 8, 16, 1, 2, 6, 12, 6, 12, 24, 20, 18, 20, 28, 28, 26, 6, 18, 24, 1, 2, 6, 12, 14, 12, 20, 6, 18, 18, 22, 26, 38, 20, 16, 16, 24, 32, 42, 44, 34, 50, 68, 70, 36, 54, 60, 54, 70, 56, 60, 82, 1, 2, 6, 12, 12, 6, 18, 36, 12, 24, 28, 34, 34, 50, 50, 72, 22, 26, 28, 34, 38, 54, 40, 52, 28, 38, 56]