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.

A290632 Array read by antidiagonals: T(m,n) = number of minimal dominating sets in the rook graph K_m X K_n.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 6
6 3
7 4
8 11
9 11
10 4
11 5
12 18
13 48
14 18
15 5
16 6
17 27
18 109
19 109
20 27
21 6
22 7
23 38
24 218
25 488
26 218
27 38
28 7
29 8
30 51
31 405
32 1409
33 1409
34 405
35 51
36 8
37 9
38 66
39 724
40 3832
41 6130
42 3832
43 724
44 66
45 9
46 10
47 83
48 1277
49 10385
50 21601
51 21601
52 10385
53 1277
54 83
55 10

List of values

[1, 2, 2, 3, 6, 3, 4, 11, 11, 4, 5, 18, 48, 18, 5, 6, 27, 109, 109, 27, 6, 7, 38, 218, 488, 218, 38, 7, 8, 51, 405, 1409, 1409, 405, 51, 8, 9, 66, 724, 3832, 6130, 3832, 724, 66, 9, 10, 83, 1277, 10385, 21601, 21601, 10385, 1277, 83, 10]