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.

A281765 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 one element, and with new values introduced in order 0 sequentially upwards.

Table of values

n a(n)
1 0
2 0
3 0
4 2
5 4
6 0
7 2
8 14
9 10
10 0
11 5
12 40
13 47
14 20
15 0
16 8
17 110
18 152
19 90
20 38
21 0
22 15
23 280
24 609
25 560
26 201
27 68
28 0
29 26
30 698
31 2138
32 2808
33 1872
34 374
35 120
36 0
37 46
38 1696
39 7466
40 13968
41 12191
42 5948
43 672
44 208
45 0
46 80
47 4052
48 25798
49 68362
50 85844
51 49986
52 18358
53 1172
54 358
55 0
56 139
57 9564
58 87397

List of values

[0, 0, 0, 2, 4, 0, 2, 14, 10, 0, 5, 40, 47, 20, 0, 8, 110, 152, 90, 38, 0, 15, 280, 609, 560, 201, 68, 0, 26, 698, 2138, 2808, 1872, 374, 120, 0, 46, 1696, 7466, 13968, 12191, 5948, 672, 208, 0, 80, 4052, 25798, 68362, 85844, 49986, 18358, 1172, 358, 0, 139, 9564, 87397]