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.

A281802 T(n,k)=Number of nXk 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.

Table of values

n a(n)
1 0
2 1
3 0
4 0
5 0
6 0
7 3
8 6
9 9
10 0
11 3
12 38
13 75
14 34
15 0
16 9
17 157
18 372
19 324
20 87
21 0
22 15
23 524
24 1725
25 1916
26 865
27 194
28 0
29 31
30 1631
31 7293
32 12318
33 8354
34 2272
35 400
36 0
37 57
38 4694
39 29665
40 71290
41 71445
42 32524
43 5191
44 790
45 0
46 108
47 13006
48 116539
49 396185
50 575062
51 368408
52 117401
53 11141

List of values

[0, 1, 0, 0, 0, 0, 3, 6, 9, 0, 3, 38, 75, 34, 0, 9, 157, 372, 324, 87, 0, 15, 524, 1725, 1916, 865, 194, 0, 31, 1631, 7293, 12318, 8354, 2272, 400, 0, 57, 4694, 29665, 71290, 71445, 32524, 5191, 790, 0, 108, 13006, 116539, 396185, 575062, 368408, 117401, 11141]