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.

A241132 Number of partitions p of n such that (maximal multiplicity over the parts of p) = (number of numbers in p having multiplicity > 1).

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 1
9 1
10 4
11 2
12 5
13 6
14 10
15 16
16 17
17 23
18 32
19 42
20 53
21 79
22 88
23 117
24 146
25 189
26 230
27 298
28 374
29 452
30 562
31 688
32 842
33 1036
34 1256
35 1520
36 1876
37 2225
38 2688
39 3226
40 3875
41 4608
42 5528
43 6553
44 7799
45 9272
46 10936
47 12903
48 15239
49 17919
50 21038
51 24714
52 28922
53 33819

List of values

[0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 4, 2, 5, 6, 10, 16, 17, 23, 32, 42, 53, 79, 88, 117, 146, 189, 230, 298, 374, 452, 562, 688, 842, 1036, 1256, 1520, 1876, 2225, 2688, 3226, 3875, 4608, 5528, 6553, 7799, 9272, 10936, 12903, 15239, 17919, 21038, 24714, 28922, 33819]