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.

A368565 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 0
3 0
4 0
5 0
6 30
7 106
8 316
9 652
10 1388
11 2618
12 5170
13 9164
14 16790
15 29046
16 50714
17 84732
18 143588
19 234048
20 385210
21 617050
22 990868
23 1558310
24 2459300
25 3806838
26 5900184

List of values

[0, 0, 0, 0, 0, 30, 106, 316, 652, 1388, 2618, 5170, 9164, 16790, 29046, 50714, 84732, 143588, 234048, 385210, 617050, 990868, 1558310, 2459300, 3806838, 5900184]