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.

A279158 T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its king-move 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 0
6 2
7 2
8 4
9 4
10 2
11 5
12 12
13 20
14 12
15 5
16 8
17 30
18 72
19 72
20 30
21 8
22 15
23 72
24 255
25 428
26 255
27 72
28 15
29 26
30 162
31 874
32 2294
33 2294
34 874
35 162
36 26
37 46
38 356
39 2903
40 11932
41 20104
42 11932
43 2903
44 356
45 46
46 80
47 766
48 9336
49 60304
50 166552
51 166552
52 60304
53 9336
54 766
55 80
56 139
57 1616
58 29578

List of values

[0, 0, 0, 2, 0, 2, 2, 4, 4, 2, 5, 12, 20, 12, 5, 8, 30, 72, 72, 30, 8, 15, 72, 255, 428, 255, 72, 15, 26, 162, 874, 2294, 2294, 874, 162, 26, 46, 356, 2903, 11932, 20104, 11932, 2903, 356, 46, 80, 766, 9336, 60304, 166552, 166552, 60304, 9336, 766, 80, 139, 1616, 29578]