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.

A239958 Number of partitions p of n such that (number of distinct parts of p) >= max(p) - min(p).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 6
6 9
7 11
8 16
9 18
10 25
11 30
12 39
13 47
14 59
15 69
16 89
17 105
18 126
19 153
20 184
21 215
22 259
23 307
24 362
25 426
26 501
27 583
28 687
29 800
30 923
31 1080
32 1252
33 1439
34 1666
35 1917
36 2202
37 2533
38 2900
39 3311
40 3792
41 4326
42 4915
43 5605
44 6366
45 7205
46 8180
47 9259
48 10458
49 11815
50 13322

List of values

[1, 1, 2, 3, 5, 6, 9, 11, 16, 18, 25, 30, 39, 47, 59, 69, 89, 105, 126, 153, 184, 215, 259, 307, 362, 426, 501, 583, 687, 800, 923, 1080, 1252, 1439, 1666, 1917, 2202, 2533, 2900, 3311, 3792, 4326, 4915, 5605, 6366, 7205, 8180, 9259, 10458, 11815, 13322]