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.

A343835 Irregular table T(n, k), n > 0, k = 1..A069010(n), read by rows; the n-th row contains the shortest partition of n whose values belong to A023758 and can be added without carriers in binary, in descending order.

Table of values

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

List of values

[1, 2, 3, 4, 4, 1, 6, 7, 8, 8, 1, 8, 2, 8, 3, 12, 12, 1, 14, 15, 16, 16, 1, 16, 2, 16, 3, 16, 4, 16, 4, 1, 16, 6, 16, 7, 24, 24, 1, 24, 2, 24, 3, 28, 28, 1, 30, 31, 32, 32, 1, 32, 2, 32, 3, 32, 4, 32, 4, 1, 32, 6, 32, 7, 32, 8, 32, 8, 1, 32, 8, 2, 32, 8, 3]