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.

A324520 Number of integer partitions of n > 0 where the minimum part equals the number of parts minus the number of distinct parts.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 2
6 2
7 3
8 3
9 7
10 6
11 11
12 12
13 15
14 21
15 25
16 31
17 43
18 49
19 58
20 79
21 89
22 108
23 135
24 165
25 190
26 232
27 279
28 328
29 387
30 461
31 536
32 650
33 743
34 870
35 1029
36 1202
37 1381
38 1613
39 1864
40 2163
41 2505
42 2875
43 3292
44 3829
45 4367
46 5001
47 5746
48 6538
49 7462
50 8533
51 9714
52 11008
53 12527
54 14196

List of values

[0, 1, 0, 1, 2, 2, 3, 3, 7, 6, 11, 12, 15, 21, 25, 31, 43, 49, 58, 79, 89, 108, 135, 165, 190, 232, 279, 328, 387, 461, 536, 650, 743, 870, 1029, 1202, 1381, 1613, 1864, 2163, 2505, 2875, 3292, 3829, 4367, 5001, 5746, 6538, 7462, 8533, 9714, 11008, 12527, 14196]