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.

A338916 Number of integer partitions of n that can be partitioned into distinct pairs of (possibly equal) parts.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 2
5 3
6 5
7 6
8 8
9 12
10 16
11 21
12 28
13 37
14 49
15 64
16 80
17 104
18 135
19 169
20 216
21 268
22 341
23 420
24 527
25 654
26 809
27 991
28 1218
29 1488
30 1828
31 2213
32 2687
33 3262
34 3934
35 4754
36 5702
37 6849
38 8200
39 9819
40 11693
41 13937
42 16562
43 19659
44 23262
45 27577
46 32493
47 38341
48 45112
49 53059
50 62265

List of values

[1, 0, 1, 1, 2, 3, 5, 6, 8, 12, 16, 21, 28, 37, 49, 64, 80, 104, 135, 169, 216, 268, 341, 420, 527, 654, 809, 991, 1218, 1488, 1828, 2213, 2687, 3262, 3934, 4754, 5702, 6849, 8200, 9819, 11693, 13937, 16562, 19659, 23262, 27577, 32493, 38341, 45112, 53059, 62265]