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.

A265508 Number of unordered pairs {p,q} of partitions of n into distinct parts such that p and q are incomparable in the dominance order.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 1
10 1
11 3
12 5
13 10
14 15
15 29
16 42
17 68
18 109
19 162
20 240
21 364
22 527
23 749
24 1096
25 1529
26 2162
27 3026
28 4179
29 5702
30 7926
31 10650
32 14412
33 19437
34 26042
35 34560
36 46077
37 60617
38 79893
39 104850
40 136851
41 177884
42 231526
43 298868
44 385221
45 496159
46 635725
47 812342

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 10, 15, 29, 42, 68, 109, 162, 240, 364, 527, 749, 1096, 1529, 2162, 3026, 4179, 5702, 7926, 10650, 14412, 19437, 26042, 34560, 46077, 60617, 79893, 104850, 136851, 177884, 231526, 298868, 385221, 496159, 635725, 812342]