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.

A339222 Number of partitions of n into parts >= 2 where every part appears at least 2 times.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 0
6 2
7 0
8 2
9 1
10 3
11 0
12 6
13 1
14 6
15 3
16 10
17 2
18 15
19 4
20 18
21 9
22 25
23 8
24 38
25 14
26 44
27 24
28 62
29 26
30 86
31 39
32 105
33 61
34 139
35 70
36 191
37 100
38 230
39 144
40 304
41 173
42 400
43 235
44 490
45 326
46 629
47 395
48 819
49 525
50 996
51 701
52 1269
53 859
54 1617
55 1114
56 1974
57 1456
58 2475
59 1783
60 3124
61 2279
62 3793
63 2920

List of values

[1, 0, 0, 0, 1, 0, 2, 0, 2, 1, 3, 0, 6, 1, 6, 3, 10, 2, 15, 4, 18, 9, 25, 8, 38, 14, 44, 24, 62, 26, 86, 39, 105, 61, 139, 70, 191, 100, 230, 144, 304, 173, 400, 235, 490, 326, 629, 395, 819, 525, 996, 701, 1269, 859, 1617, 1114, 1974, 1456, 2475, 1783, 3124, 2279, 3793, 2920]