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.

A057601 a(0) = a(1) = 1; a(n+1) is the number of partitions of n into parts a(k), 0 <= k <= n, each k occurring at most once.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 4
6 6
7 8
8 10
9 11
10 12
11 14
12 17
13 21
14 25
15 29
16 33
17 37
18 43
19 49
20 54
21 59
22 66
23 72
24 80
25 89
26 98
27 106
28 116
29 126
30 137
31 148
32 161
33 174
34 187
35 200
36 216
37 232
38 248
39 266
40 284
41 302
42 321
43 344
44 367
45 391
46 414
47 440
48 465
49 493
50 523
51 556
52 584
53 616
54 650
55 689
56 726
57 768
58 808

List of values

[1, 1, 2, 2, 4, 4, 6, 8, 10, 11, 12, 14, 17, 21, 25, 29, 33, 37, 43, 49, 54, 59, 66, 72, 80, 89, 98, 106, 116, 126, 137, 148, 161, 174, 187, 200, 216, 232, 248, 266, 284, 302, 321, 344, 367, 391, 414, 440, 465, 493, 523, 556, 584, 616, 650, 689, 726, 768, 808]