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.

A241412 Number of partitions of n such that neither the number of parts having multiplicity >1 nor the number of distinct parts is a part.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 3
5 2
6 4
7 4
8 7
9 7
10 11
11 14
12 19
13 21
14 30
15 38
16 51
17 59
18 81
19 98
20 124
21 156
22 199
23 239
24 311
25 365
26 468
27 572
28 711
29 844
30 1070
31 1271
32 1572
33 1884
34 2318
35 2749
36 3387
37 4000
38 4879
39 5796
40 6977
41 8266
42 9986
43 11769
44 14071
45 16632
46 19800
47 23300
48 27700
49 32471
50 38447

List of values

[1, 0, 1, 1, 3, 2, 4, 4, 7, 7, 11, 14, 19, 21, 30, 38, 51, 59, 81, 98, 124, 156, 199, 239, 311, 365, 468, 572, 711, 844, 1070, 1271, 1572, 1884, 2318, 2749, 3387, 4000, 4879, 5796, 6977, 8266, 9986, 11769, 14071, 16632, 19800, 23300, 27700, 32471, 38447]