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.

A368566 a(n) = number of pairs (p,q) of partitions of n such that d(p,q) > o(p,q), where d and o are distance functions; see Comments.

Table of values

n a(n)
1 0
2 2
3 6
4 18
5 34
6 48
7 62
8 108
9 166
10 242
11 334
12 512
13 706
14 984
15 1368
16 1876
17 2492
18 3360
19 4422
20 5848
21 7574
22 9792
23 12596
24 16130
25 20412
26 25850

List of values

[0, 2, 6, 18, 34, 48, 62, 108, 166, 242, 334, 512, 706, 984, 1368, 1876, 2492, 3360, 4422, 5848, 7574, 9792, 12596, 16130, 20412, 25850]