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.

A240027 Number of partitions of n such that the successive differences of consecutive parts are strictly increasing.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 4
6 5
7 7
8 9
9 9
10 13
11 14
12 16
13 20
14 23
15 25
16 32
17 34
18 38
19 45
20 51
21 55
22 65
23 70
24 77
25 89
26 99
27 106
28 122
29 131
30 143
31 161
32 177
33 189
34 211
35 229
36 248
37 272
38 298
39 317
40 349
41 378
42 406
43 440
44 479
45 511
46 554
47 597
48 640
49 686
50 744
51 792
52 850
53 913
54 973
55 1039
56 1122
57 1189
58 1268
59 1358
60 1444
61 1532
62 1646
63 1742
64 1847
65 1975
66 2094
67 2210
68 2366

List of values

[1, 1, 2, 2, 4, 4, 5, 7, 9, 9, 13, 14, 16, 20, 23, 25, 32, 34, 38, 45, 51, 55, 65, 70, 77, 89, 99, 106, 122, 131, 143, 161, 177, 189, 211, 229, 248, 272, 298, 317, 349, 378, 406, 440, 479, 511, 554, 597, 640, 686, 744, 792, 850, 913, 973, 1039, 1122, 1189, 1268, 1358, 1444, 1532, 1646, 1742, 1847, 1975, 2094, 2210, 2366]