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.

A368564 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 1
2 2
3 3
4 7
5 15
6 43
7 57
8 60
9 82
10 134
11 184
12 247
13 331
14 451
15 562
16 771
17 985
18 1277
19 1630
20 2071
21 2640
22 3344
23 4119
24 5195
25 6514
26 8062

List of values

[1, 2, 3, 7, 15, 43, 57, 60, 82, 134, 184, 247, 331, 451, 562, 771, 985, 1277, 1630, 2071, 2640, 3344, 4119, 5195, 6514, 8062]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.