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.

A283572 T(n,k) = Number of n X k 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 4
6 0
7 2
8 26
9 16
10 0
11 5
12 72
13 169
14 68
15 0
16 12
17 282
18 674
19 1108
20 256
21 0
22 26
23 908
24 4313
25 6812
26 6453
27 924
28 0
29 56
30 2832
31 21186
32 67892
33 60802
34 36038
35 3232
36 0
37 118
38 8856
39 104464
40 509952
41 945100
42 528436
43 194173
44 11044
45 0
46 244
47 26750
48 513458
49 3890056
50 10919674

List of values

[0, 0, 0, 1, 4, 0, 2, 26, 16, 0, 5, 72, 169, 68, 0, 12, 282, 674, 1108, 256, 0, 26, 908, 4313, 6812, 6453, 924, 0, 56, 2832, 21186, 67892, 60802, 36038, 3232, 0, 118, 8856, 104464, 509952, 945100, 528436, 194173, 11044, 0, 244, 26750, 513458, 3890056, 10919674]