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.

A239956 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 0
1 0
2 0
3 0
4 1
5 1
6 2
7 3
8 6
9 5
10 10
11 12
12 16
13 21
14 28
15 30
16 45
17 53
18 63
19 81
20 99
21 114
22 144
23 173
24 204
25 245
26 293
27 340
28 410
29 482
30 554
31 662
32 774
33 890
34 1044
35 1207
36 1393
37 1619
38 1864
39 2134
40 2464
41 2828
42 3220
43 3701
44 4223
45 4789
46 5474
47 6223
48 7050
49 8004
50 9058
51 10230
52 11579

List of values

[0, 0, 0, 0, 1, 1, 2, 3, 6, 5, 10, 12, 16, 21, 28, 30, 45, 53, 63, 81, 99, 114, 144, 173, 204, 245, 293, 340, 410, 482, 554, 662, 774, 890, 1044, 1207, 1393, 1619, 1864, 2134, 2464, 2828, 3220, 3701, 4223, 4789, 5474, 6223, 7050, 8004, 9058, 10230, 11579]