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.

A059520 Number of partitions into distinct parts, with some sub-partitions having equal sums. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ...

Table of values

n a(n)
1 7
2 13
3 15
4 22
5 23
6 25
7 27
8 29
9 30
10 31
11 39
12 42
13 43
14 45
15 46
16 47
17 49
18 51
19 53
20 54
21 55
22 57
23 58
24 59
25 60
26 61
27 62
28 63
29 71
30 75
31 76
32 77
33 78
34 79
35 82
36 83
37 85
38 86
39 87
40 89
41 90
42 91
43 92
44 93
45 94
46 95
47 97
48 99
49 101
50 102
51 103
52 105
53 106
54 107
55 108
56 109
57 110
58 111
59 113
60 114
61 115
62 117
63 118
64 119

List of values

[7, 13, 15, 22, 23, 25, 27, 29, 30, 31, 39, 42, 43, 45, 46, 47, 49, 51, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 71, 75, 76, 77, 78, 79, 82, 83, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 97, 99, 101, 102, 103, 105, 106, 107, 108, 109, 110, 111, 113, 114, 115, 117, 118, 119]