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.

A240303 Number of partitions of n such that (maximal multiplicity of parts) = (multiplicity of the least part).

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 5
5 6
6 11
7 13
8 19
9 26
10 37
11 44
12 66
13 80
14 108
15 139
16 182
17 226
18 298
19 366
20 474
21 588
22 742
23 911
24 1154
25 1408
26 1751
27 2143
28 2642
29 3205
30 3944
31 4761
32 5805
33 6998
34 8479
35 10177
36 12285
37 14679
38 17620
39 21014
40 25114
41 29822
42 35529
43 42057
44 49894
45 58927
46 69644
47 81994

List of values

[0, 1, 2, 3, 5, 6, 11, 13, 19, 26, 37, 44, 66, 80, 108, 139, 182, 226, 298, 366, 474, 588, 742, 911, 1154, 1408, 1751, 2143, 2642, 3205, 3944, 4761, 5805, 6998, 8479, 10177, 12285, 14679, 17620, 21014, 25114, 29822, 35529, 42057, 49894, 58927, 69644, 81994]