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.

A384122 Array read by antidiagonals: T(n,m) is the number of minimum 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 3
18 3
19 1
20 1
21 1
22 1
23 4
24 48
25 4
26 1
27 1
28 1
29 1
30 5
31 100
32 100
33 5
34 1
35 1
36 1
37 1
38 6
39 185
40 240
41 185
42 6
43 1
44 1
45 1
46 1
47 7
48 306
49 480
50 480
51 306
52 7
53 1
54 1
55 1
56 1
57 8
58 469
59 840
60 1000
61 840
62 469
63 8
64 1
65 1
66 1
67 1
68 9
69 680
70 1344
71 1800
72 1800
73 1344
74 680
75 9
76 1
77 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 4, 48, 4, 1, 1, 1, 1, 5, 100, 100, 5, 1, 1, 1, 1, 6, 185, 240, 185, 6, 1, 1, 1, 1, 7, 306, 480, 480, 306, 7, 1, 1, 1, 1, 8, 469, 840, 1000, 840, 469, 8, 1, 1, 1, 1, 9, 680, 1344, 1800, 1800, 1344, 680, 9, 1, 1]