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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 2
6 2
7 2
8 5
9 2
10 8
11 6
12 6
13 10
14 14
15 12
16 20
17 27
18 23
19 40
20 40
21 51
22 62
23 82
24 88
25 123
26 135
27 173
28 197
29 253
30 285
31 350
32 419
33 497
34 594
35 708
36 855
37 978
38 1195
39 1395
40 1648
41 1915
42 2313
43 2625
44 3170
45 3625
46 4336
47 4948
48 5900
49 6751
50 7970
51 9180
52 10704
53 12337
54 14436
55 16517

List of values

[1, 1, 1, 2, 2, 2, 2, 5, 2, 8, 6, 6, 10, 14, 12, 20, 27, 23, 40, 40, 51, 62, 82, 88, 123, 135, 173, 197, 253, 285, 350, 419, 497, 594, 708, 855, 978, 1195, 1395, 1648, 1915, 2313, 2625, 3170, 3625, 4336, 4948, 5900, 6751, 7970, 9180, 10704, 12337, 14436, 16517]