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.

A240302 Number of partitions of n such that (maximal multiplicity of parts) > (multiplicity of the maximal part).

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 2
6 3
7 7
8 10
9 16
10 23
11 35
12 47
13 70
14 93
15 126
16 169
17 228
18 294
19 391
20 501
21 648
22 827
23 1057
24 1329
25 1683
26 2105
27 2631
28 3266
29 4056
30 4992
31 6156
32 7538
33 9221
34 11234
35 13664
36 16549
37 20033
38 24152
39 29077
40 34904
41 41844
42 50012
43 59710
44 71100
45 84541
46 100318
47 118869

List of values

[0, 0, 0, 0, 1, 2, 3, 7, 10, 16, 23, 35, 47, 70, 93, 126, 169, 228, 294, 391, 501, 648, 827, 1057, 1329, 1683, 2105, 2631, 3266, 4056, 4992, 6156, 7538, 9221, 11234, 13664, 16549, 20033, 24152, 29077, 34904, 41844, 50012, 59710, 71100, 84541, 100318, 118869]