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.

A339559 Number of integer partitions of n that have an even number of parts and cannot be partitioned into distinct pairs of distinct parts, i.e., that are not the multiset union of any set of edges.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 2
5 1
6 4
7 3
8 7
9 6
10 14
11 14
12 23
13 27
14 41
15 47
16 70
17 84
18 114
19 141
20 190
21 225
22 303
23 370
24 475
25 578
26 738
27 890
28 1131
29 1368
30 1698
31 2058
32 2549
33 3048
34 3759
35 4505
36 5495
37 6574
38 7966
39 9483
40 11450
41 13606
42 16307
43 19351
44 23116
45 27297
46 32470
47 38293
48 45346
49 53342
50 62939

List of values

[0, 0, 1, 0, 2, 1, 4, 3, 7, 6, 14, 14, 23, 27, 41, 47, 70, 84, 114, 141, 190, 225, 303, 370, 475, 578, 738, 890, 1131, 1368, 1698, 2058, 2549, 3048, 3759, 4505, 5495, 6574, 7966, 9483, 11450, 13606, 16307, 19351, 23116, 27297, 32470, 38293, 45346, 53342, 62939]