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.

A279977 T(n,k) is the number of n X k 0..1 arrays with no element equal to a strict majority of its horizontal 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 3
6 0
7 3
8 9
9 9
10 0
11 3
12 24
13 50
14 31
15 0
16 9
17 62
18 221
19 296
20 108
21 0
22 15
23 134
24 822
25 1922
26 1650
27 366
28 0
29 31
30 277
31 2669
32 10491
33 15511
34 8666
35 1205
36 0
37 57
38 542
39 8068
40 50690
41 124030
42 118857
43 43543
44 3873
45 0
46 108
47 1035
48 23169
49 226771
50 887491
51 1393359
52 876704
53 211650

List of values

[0, 1, 0, 0, 3, 0, 3, 9, 9, 0, 3, 24, 50, 31, 0, 9, 62, 221, 296, 108, 0, 15, 134, 822, 1922, 1650, 366, 0, 31, 277, 2669, 10491, 15511, 8666, 1205, 0, 57, 542, 8068, 50690, 124030, 118857, 43543, 3873, 0, 108, 1035, 23169, 226771, 887491, 1393359, 876704, 211650]