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.

A240308 Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (number of distinct parts of p).

Table of values

n a(n)
0 0
1 1
2 2
3 2
4 4
5 5
6 8
7 10
8 15
9 18
10 28
11 35
12 48
13 63
14 85
15 106
16 141
17 180
18 229
19 294
20 374
21 468
22 591
23 741
24 925
25 1149
26 1421
27 1751
28 2163
29 2648
30 3239
31 3944
32 4813
33 5825
34 7062
35 8518
36 10286
37 12340
38 14835
39 17739
40 21223
41 25287
42 30155
43 35787
44 42522
45 50296
46 59556
47 70243
48 82902

List of values

[0, 1, 2, 2, 4, 5, 8, 10, 15, 18, 28, 35, 48, 63, 85, 106, 141, 180, 229, 294, 374, 468, 591, 741, 925, 1149, 1421, 1751, 2163, 2648, 3239, 3944, 4813, 5825, 7062, 8518, 10286, 12340, 14835, 17739, 21223, 25287, 30155, 35787, 42522, 50296, 59556, 70243, 82902]