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.

A279268 T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and vertical 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 2
7 2
8 10
9 10
10 2
11 5
12 20
13 29
14 20
15 5
16 8
17 38
18 86
19 86
20 38
21 8
22 15
23 68
24 240
25 400
26 240
27 68
28 15
29 26
30 120
31 626
32 1592
33 1592
34 626
35 120
36 26
37 46
38 208
39 1603
40 5888
41 9042
42 5888
43 1603
44 208
45 46
46 80
47 358
48 4030
49 21882
50 51568
51 51568
52 21882
53 4030
54 358
55 80
56 139
57 612
58 9973
59 79112

List of values

[0, 0, 0, 2, 4, 2, 2, 10, 10, 2, 5, 20, 29, 20, 5, 8, 38, 86, 86, 38, 8, 15, 68, 240, 400, 240, 68, 15, 26, 120, 626, 1592, 1592, 626, 120, 26, 46, 208, 1603, 5888, 9042, 5888, 1603, 208, 46, 80, 358, 4030, 21882, 51568, 51568, 21882, 4030, 358, 80, 139, 612, 9973, 79112]