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.

A241411 Number of partitions of n such that the number of parts having multiplicity >1 is a part and the number of distinct parts is not a part.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 1
6 2
7 4
8 5
9 9
10 12
11 18
12 23
13 37
14 44
15 64
16 80
17 111
18 139
19 185
20 235
21 306
22 380
23 488
24 611
25 771
26 956
27 1191
28 1472
29 1823
30 2238
31 2748
32 3345
33 4098
34 4967
35 6025
36 7279
37 8797
38 10558
39 12709
40 15204
41 18215
42 21692
43 25880
44 30702
45 36545
46 43194
47 51166
48 60314
49 71255

List of values

[0, 0, 0, 0, 0, 1, 2, 4, 5, 9, 12, 18, 23, 37, 44, 64, 80, 111, 139, 185, 235, 306, 380, 488, 611, 771, 956, 1191, 1472, 1823, 2238, 2748, 3345, 4098, 4967, 6025, 7279, 8797, 10558, 12709, 15204, 18215, 21692, 25880, 30702, 36545, 43194, 51166, 60314, 71255]