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.

A241518 Number of partitions p of n such that #m(1) = #m(2), where #m(i) = number of numbers in p that have multiplicity i.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 2
5 3
6 3
7 4
8 5
9 6
10 8
11 12
12 16
13 23
14 27
15 41
16 46
17 63
18 71
19 96
20 109
21 148
22 161
23 219
24 256
25 332
26 379
27 500
28 580
29 738
30 859
31 1079
32 1250
33 1560
34 1791
35 2220
36 2563
37 3116
38 3595
39 4369
40 5054
41 6080
42 7020
43 8418
44 9729
45 11617
46 13409
47 15911
48 18417
49 21713
50 25078
51 29467

List of values

[1, 0, 0, 1, 2, 3, 3, 4, 5, 6, 8, 12, 16, 23, 27, 41, 46, 63, 71, 96, 109, 148, 161, 219, 256, 332, 379, 500, 580, 738, 859, 1079, 1250, 1560, 1791, 2220, 2563, 3116, 3595, 4369, 5054, 6080, 7020, 8418, 9729, 11617, 13409, 15911, 18417, 21713, 25078, 29467]