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.

A179269 Number of partitions of n into distinct parts such that the successive differences of consecutive parts are increasing, and first difference > first part.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 2
7 3
8 3
9 3
10 5
11 5
12 5
13 7
14 7
15 7
16 10
17 10
18 10
19 13
20 14
21 14
22 18
23 19
24 19
25 23
26 25
27 25
28 30
29 32
30 33
31 38
32 41
33 42
34 48
35 52
36 54
37 60
38 65
39 67
40 75
41 81
42 84
43 92
44 99
45 103
46 113
47 121
48 126
49 136
50 147
51 153
52 165
53 177
54 184
55 197
56 213
57 221
58 236
59 253
60 264
61 280
62 301
63 313
64 331
65 355
66 371
67 390
68 418
69 435
70 458

List of values

[1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 5, 5, 5, 7, 7, 7, 10, 10, 10, 13, 14, 14, 18, 19, 19, 23, 25, 25, 30, 32, 33, 38, 41, 42, 48, 52, 54, 60, 65, 67, 75, 81, 84, 92, 99, 103, 113, 121, 126, 136, 147, 153, 165, 177, 184, 197, 213, 221, 236, 253, 264, 280, 301, 313, 331, 355, 371, 390, 418, 435, 458]