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.

A384119 Array read by antidiagonals: T(n,m) is the number of minimum 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 1
5 1
6 1
7 2
8 2
9 1
10 1
11 3
12 6
13 3
14 1
15 1
16 4
17 9
18 9
19 4
20 1
21 1
22 5
23 16
24 48
25 16
26 5
27 1
28 1
29 6
30 25
31 64
32 64
33 25
34 6
35 1
36 1
37 7
38 36
39 125
40 488
41 125
42 36
43 7
44 1
45 1
46 8
47 49
48 216
49 625
50 625
51 216
52 49
53 8
54 1
55 1
56 9
57 64
58 343
59 1296
60 6130
61 1296
62 343
63 64
64 9
65 1
66 1
67 10
68 81
69 512
70 2401
71 7776
72 7776
73 2401
74 512
75 81
76 10
77 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 6, 3, 1, 1, 4, 9, 9, 4, 1, 1, 5, 16, 48, 16, 5, 1, 1, 6, 25, 64, 64, 25, 6, 1, 1, 7, 36, 125, 488, 125, 36, 7, 1, 1, 8, 49, 216, 625, 625, 216, 49, 8, 1, 1, 9, 64, 343, 1296, 6130, 1296, 343, 64, 9, 1, 1, 10, 81, 512, 2401, 7776, 7776, 2401, 512, 81, 10, 1]