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.

A241274 Number of partitions p of n such that (number of numbers in p that have multiplicity 1) = (number of numbers in p having multiplicity > 1).

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 3
6 3
7 7
8 7
9 10
10 12
11 16
12 14
13 23
14 25
15 33
16 41
17 59
18 72
19 101
20 126
21 171
22 216
23 280
24 344
25 436
26 535
27 666
28 788
29 970
30 1153
31 1394
32 1649
33 1996
34 2336
35 2796
36 3326
37 3965
38 4689
39 5627
40 6629
41 7926
42 9404
43 11192
44 13273
45 15777
46 18637
47 22057
48 26067
49 30672
50 36122

List of values

[1, 0, 0, 0, 1, 3, 3, 7, 7, 10, 12, 16, 14, 23, 25, 33, 41, 59, 72, 101, 126, 171, 216, 280, 344, 436, 535, 666, 788, 970, 1153, 1394, 1649, 1996, 2336, 2796, 3326, 3965, 4689, 5627, 6629, 7926, 9404, 11192, 13273, 15777, 18637, 22057, 26067, 30672, 36122]