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.

A284592 Square array read by antidiagonals: T(n,k) is the number of pairs of partitions of n and k respectively, such that the pair of partitions have no part in common.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 0
5 2
6 3
7 1
8 1
9 3
10 5
11 1
12 2
13 1
14 5
15 7
16 2
17 3
18 3
19 2
20 7
21 11
22 2
23 5
24 4
25 5
26 2
27 11
28 15
29 4
30 6
31 7
32 7
33 6
34 4
35 15
36 22
37 4
38 10
39 8
40 12
41 8
42 10
43 4
44 22
45 30
46 7
47 12
48 14
49 14
50 14
51 14
52 12
53 7
54 30
55 42
56 8
57 18
58 16
59 24
60 16
61 24
62 16
63 18
64 8
65 42
66 56
67 12
68 23
69 25
70 28
71 28
72 28
73 28
74 25
75 23
76 12
77 56

List of values

[1, 1, 1, 2, 0, 2, 3, 1, 1, 3, 5, 1, 2, 1, 5, 7, 2, 3, 3, 2, 7, 11, 2, 5, 4, 5, 2, 11, 15, 4, 6, 7, 7, 6, 4, 15, 22, 4, 10, 8, 12, 8, 10, 4, 22, 30, 7, 12, 14, 14, 14, 14, 12, 7, 30, 42, 8, 18, 16, 24, 16, 24, 16, 18, 8, 42, 56, 12, 23, 25, 28, 28, 28, 28, 25, 23, 12, 56]