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.

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

Table of values

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

List of values

[1, 2, 2, 1, 4, 1, 4, 2, 2, 4, 3, 16, 1, 16, 3, 1, 12, 4, 4, 12, 1, 8, 4, 3, 256, 3, 4, 8, 4, 64, 1, 144, 144, 1, 64, 4, 1, 32, 8, 16, 79, 16, 8, 32, 1, 13, 8, 4, 4096, 9, 9, 4096, 4, 8, 13, 5, 208, 1, 1024, 1656, 1, 1656, 1024, 1, 208, 5, 1, 80, 13, 64, 408, 64, 64, 408, 64, 13, 80, 1]