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.

A384118 Array read by antidiagonals: T(n,m) is the number of minimal 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 5
18 5
19 6
20 1
21 1
22 10
23 12
24 51
25 12
26 10
27 1
28 1
29 15
30 37
31 97
32 97
33 37
34 15
35 1
36 1
37 21
38 98
39 218
40 368
41 218
42 98
43 21
44 1
45 1
46 28
47 219
48 519
49 2229
50 2229
51 519
52 219
53 28
54 1
55 1
56 36
57 430
58 1417
59 6232
60 7310
61 6232
62 1417
63 430
64 36
65 1

List of values

[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 3, 4, 3, 1, 1, 6, 5, 5, 6, 1, 1, 10, 12, 51, 12, 10, 1, 1, 15, 37, 97, 97, 37, 15, 1, 1, 21, 98, 218, 368, 218, 98, 21, 1, 1, 28, 219, 519, 2229, 2229, 519, 219, 28, 1, 1, 36, 430, 1417, 6232, 7310, 6232, 1417, 430, 36, 1]