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.

A282791 T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than one of its king-move neighbors, with the exception of exactly one element.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 0
6 1
7 2
8 8
9 8
10 2
11 5
12 16
13 73
14 16
15 5
16 12
17 72
18 318
19 318
20 72
21 12
22 26
23 240
24 1747
25 1952
26 1747
27 240
28 26
29 56
30 736
31 8216
32 16584
33 16584
34 8216
35 736
36 56
37 118
38 2352
39 38027
40 119176
41 208559
42 119176
43 38027
44 2352
45 118
46 244
47 7128
48 173722
49 832218
50 2207352
51 2207352

List of values

[0, 0, 0, 1, 0, 1, 2, 8, 8, 2, 5, 16, 73, 16, 5, 12, 72, 318, 318, 72, 12, 26, 240, 1747, 1952, 1747, 240, 26, 56, 736, 8216, 16584, 16584, 8216, 736, 56, 118, 2352, 38027, 119176, 208559, 119176, 38027, 2352, 118, 244, 7128, 173722, 832218, 2207352, 2207352]