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.

A280233 T(n,k)=Number of nXk 0..1 arrays with no element unequal 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 4
6 2
7 2
8 6
9 6
10 2
11 5
12 8
13 9
14 8
15 5
16 8
17 14
18 16
19 16
20 14
21 8
22 15
23 24
24 29
25 48
26 29
27 24
28 15
29 26
30 42
31 52
32 116
33 116
34 52
35 42
36 26
37 46
38 72
39 95
40 288
41 355
42 288
43 95
44 72
45 46
46 80
47 124
48 168
49 678
50 1102
51 1102
52 678
53 168
54 124
55 80
56 139
57 212
58 298
59 1600
60 3376
61 4260
62 3376
63 1600
64 298
65 212

List of values

[0, 0, 0, 2, 4, 2, 2, 6, 6, 2, 5, 8, 9, 8, 5, 8, 14, 16, 16, 14, 8, 15, 24, 29, 48, 29, 24, 15, 26, 42, 52, 116, 116, 52, 42, 26, 46, 72, 95, 288, 355, 288, 95, 72, 46, 80, 124, 168, 678, 1102, 1102, 678, 168, 124, 80, 139, 212, 298, 1600, 3376, 4260, 3376, 1600, 298, 212]