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.

A284593 Square array read by antidiagonals: T(n,k) = the number of pairs of partitions of n and k respectively, such that each partition is composed of distinct parts and the pair of partitions have no part in common.

Table of values

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

List of values

[1, 1, 1, 1, 0, 1, 2, 1, 1, 2, 2, 1, 0, 1, 2, 3, 1, 1, 1, 1, 3, 4, 2, 2, 2, 2, 2, 4, 5, 2, 2, 2, 2, 2, 2, 5, 6, 3, 2, 3, 2, 3, 2, 3, 6, 8, 3, 3, 4, 3, 3, 4, 3, 3, 8, 10, 5, 4, 6, 5, 6, 5, 6, 4, 5, 10, 12, 5, 5, 6, 5, 6, 6, 5, 6, 5, 5, 12, 15, 7, 6, 8, 7, 8, 8, 8, 7, 8, 6, 7, 15]