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.

A279168 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 two elements, and with new values introduced in order 0 sequentially upwards.

Table of values

n a(n)
1 0
2 1
3 1
4 0
5 0
6 0
7 3
8 0
9 0
10 3
11 3
12 8
13 16
14 8
15 3
16 9
17 24
18 117
19 117
20 24
21 9
22 15
23 88
24 483
25 864
26 483
27 88
28 15
29 31
30 284
31 2001
32 5628
33 5628
34 2001
35 284
36 31
37 57
38 772
39 7709
40 34764
41 57248
42 34764
43 7709
44 772
45 57
46 108
47 2000
48 28139
49 203226
50 557163
51 557163
52 203226
53 28139
54 2000
55 108
56 199

List of values

[0, 1, 1, 0, 0, 0, 3, 0, 0, 3, 3, 8, 16, 8, 3, 9, 24, 117, 117, 24, 9, 15, 88, 483, 864, 483, 88, 15, 31, 284, 2001, 5628, 5628, 2001, 284, 31, 57, 772, 7709, 34764, 57248, 34764, 7709, 772, 57, 108, 2000, 28139, 203226, 557163, 557163, 203226, 28139, 2000, 108, 199]