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.

A241131 Number of partitions p of n such that (maximal multiplicity over the parts of p) = number of 1s in p.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 3
5 4
6 7
7 9
8 13
9 18
10 26
11 32
12 47
13 60
14 79
15 104
16 137
17 173
18 227
19 285
20 365
21 461
22 583
23 724
24 912
25 1129
26 1403
27 1729
28 2137
29 2611
30 3211
31 3906
32 4765
33 5777
34 7010
35 8450
36 10213
37 12263
38 14738
39 17637
40 21113
41 25158
42 30008
43 35638
44 42333
45 50130
46 59346
47 70035
48 82663

List of values

[0, 1, 1, 2, 3, 4, 7, 9, 13, 18, 26, 32, 47, 60, 79, 104, 137, 173, 227, 285, 365, 461, 583, 724, 912, 1129, 1403, 1729, 2137, 2611, 3211, 3906, 4765, 5777, 7010, 8450, 10213, 12263, 14738, 17637, 21113, 25158, 30008, 35638, 42333, 50130, 59346, 70035, 82663]