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.

A303335 Array read by antidiagonals: T(m,n) is the number of minimum total dominating sets in the m X n king graph.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 6
6 2
7 1
8 9
9 9
10 1
11 1
12 4
13 8
14 4
15 1
16 4
17 8
18 1
19 1
20 8
21 4
22 3
23 89
24 3
25 35
26 3
27 89
28 3
29 1
30 56
31 76
32 9
33 9
34 76
35 56
36 1
37 2
38 16
39 17
40 1
41 1
42 1
43 17
44 16
45 2
46 9
47 64
48 1
49 130
50 9
51 9
52 130
53 1
54 64
55 9
56 4
57 780
58 6
59 16
60 60
61 8684
62 60
63 16
64 6
65 780
66 4
67 1
68 304
69 229
70 1
71 89
72 493
73 493
74 89
75 1
76 229
77 304
78 1

List of values

[0, 1, 1, 2, 6, 2, 1, 9, 9, 1, 1, 4, 8, 4, 1, 4, 8, 1, 1, 8, 4, 3, 89, 3, 35, 3, 89, 3, 1, 56, 76, 9, 9, 76, 56, 1, 2, 16, 17, 1, 1, 1, 17, 16, 2, 9, 64, 1, 130, 9, 9, 130, 1, 64, 9, 4, 780, 6, 16, 60, 8684, 60, 16, 6, 780, 4, 1, 304, 229, 1, 89, 493, 493, 89, 1, 229, 304, 1]