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.

A384123 Array read by antidiagonals: T(n,m) is the number of minimal dominating sets in the n X m rook complement graph.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 5, 5, 1, 1, 1, 1, 12, 48, 12, 1, 1, 1, 1, 37, 121, 121, 37, 1, 1, 1, 1, 98, 278, 320, 278, 98, 1, 1, 1, 1, 219, 579, 729, 729, 579, 219, 1, 1, 1, 1, 430, 1102, 1480, 1610, 1480, 1102, 430, 1, 1, 1, 1, 767, 1943, 2741, 3161, 3161, 2741, 1943, 767, 1, 1]