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.

A339560 Number of integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 2
6 2
7 4
8 5
9 8
10 8
11 13
12 17
13 22
14 28
15 39
16 48
17 62
18 81
19 101
20 127
21 167
22 202
23 253
24 318
25 395
26 486
27 608
28 736
29 906
30 1113
31 1353
32 1637
33 2011
34 2409
35 2922
36 3510
37 4227
38 5060
39 6089
40 7242
41 8661
42 10306
43 12251
44 14503
45 17236
46 20345
47 24045
48 28334
49 33374
50 39223
51 46076

List of values

[1, 0, 0, 1, 1, 2, 2, 4, 5, 8, 8, 13, 17, 22, 28, 39, 48, 62, 81, 101, 127, 167, 202, 253, 318, 395, 486, 608, 736, 906, 1113, 1353, 1637, 2011, 2409, 2922, 3510, 4227, 5060, 6089, 7242, 8661, 10306, 12251, 14503, 17236, 20345, 24045, 28334, 33374, 39223, 46076]