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.

A088567 Number of "non-squashing" partitions of n into distinct parts.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 4
7 5
8 6
9 7
10 9
11 10
12 13
13 14
14 18
15 19
16 24
17 25
18 31
19 32
20 40
21 41
22 50
23 51
24 63
25 64
26 77
27 78
28 95
29 96
30 114
31 115
32 138
33 139
34 163
35 164
36 194
37 195
38 226
39 227
40 266
41 267
42 307
43 308
44 357
45 358
46 408
47 409
48 471
49 472
50 535
51 536
52 612
53 613
54 690
55 691
56 785
57 786
58 881
59 882
60 995
61 996
62 1110
63 1111

List of values

[1, 1, 1, 2, 2, 3, 4, 5, 6, 7, 9, 10, 13, 14, 18, 19, 24, 25, 31, 32, 40, 41, 50, 51, 63, 64, 77, 78, 95, 96, 114, 115, 138, 139, 163, 164, 194, 195, 226, 227, 266, 267, 307, 308, 357, 358, 408, 409, 471, 472, 535, 536, 612, 613, 690, 691, 785, 786, 881, 882, 995, 996, 1110, 1111]