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.

A325279 Number of integer partitions of n whose maximum multiplicity is one greater than their minimum multiplicity.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 2
6 1
7 5
8 6
9 9
10 10
11 18
12 18
13 31
14 34
15 48
16 57
17 80
18 86
19 122
20 138
21 183
22 211
23 275
24 311
25 402
26 461
27 576
28 663
29 825
30 942
31 1163
32 1334
33 1621
34 1865
35 2248
36 2566
37 3084
38 3532
39 4193
40 4794
41 5674
42 6472
43 7617
44 8685
45 10153
46 11576
47 13483
48 15320
49 17790
50 20200
51 23342

List of values

[0, 0, 0, 0, 1, 2, 1, 5, 6, 9, 10, 18, 18, 31, 34, 48, 57, 80, 86, 122, 138, 183, 211, 275, 311, 402, 461, 576, 663, 825, 942, 1163, 1334, 1621, 1865, 2248, 2566, 3084, 3532, 4193, 4794, 5674, 6472, 7617, 8685, 10153, 11576, 13483, 15320, 17790, 20200, 23342]