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.

A059519 Number of partitions of n all of whose subpartitions sum to distinct values. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ...

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 8
8 9
9 10
10 11
11 12
12 14
13 16
14 17
15 18
16 19
17 20
18 21
19 24
20 26
21 28
22 32
23 33
24 34
25 35
26 36
27 37
28 38
29 40
30 41
31 44
32 48
33 50
34 52
35 56
36 64
37 65
38 66
39 67
40 68
41 69
42 70
43 72
44 73
45 74
46 80
47 81
48 84
49 88
50 96
51 98
52 100
53 104
54 112
55 116
56 128
57 129
58 130
59 131
60 132
61 133
62 134
63 136
64 137
65 138
66 139
67 140

List of values

[1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19, 20, 21, 24, 26, 28, 32, 33, 34, 35, 36, 37, 38, 40, 41, 44, 48, 50, 52, 56, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 80, 81, 84, 88, 96, 98, 100, 104, 112, 116, 128, 129, 130, 131, 132, 133, 134, 136, 137, 138, 139, 140]