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.

A384117 Array read by antidiagonals: T(n,m) is the number of minimum total dominating sets in the n X m rook graph K_n X K_m.

Table of values

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

List of values

[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 3, 4, 3, 1, 1, 6, 3, 3, 6, 1, 1, 10, 4, 6, 4, 10, 1, 1, 15, 5, 4, 4, 5, 15, 1, 1, 21, 6, 5, 80, 5, 6, 21, 1, 1, 28, 7, 6, 65, 65, 6, 7, 28, 1, 1, 36, 8, 7, 96, 410, 96, 7, 8, 36, 1, 1, 45, 9, 8, 133, 306, 306, 133, 8, 9, 45, 1]