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.

A286216 T(n,k) = Number of n X k 0..1 arrays with the number of 1's king-move adjacent to some 0 two less than the number of 0's adjacent to some 1.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 4
6 0
7 0
8 17
9 17
10 0
11 0
12 62
13 52
14 62
15 0
16 1
17 238
18 684
19 684
20 238
21 1
22 3
23 912
24 2128
25 10056
26 2128
27 912
28 3
29 10
30 3468
31 34896
32 141018
33 141018
34 34896
35 3468
36 10
37 24
38 13224
39 123541
40 2053994
41 1656022
42 2053994
43 123541
44 13224
45 24
46 60
47 50655
48 1891998
49 30004158

List of values

[0, 0, 0, 0, 4, 0, 0, 17, 17, 0, 0, 62, 52, 62, 0, 1, 238, 684, 684, 238, 1, 3, 912, 2128, 10056, 2128, 912, 3, 10, 3468, 34896, 141018, 141018, 34896, 3468, 10, 24, 13224, 123541, 2053994, 1656022, 2053994, 123541, 13224, 24, 60, 50655, 1891998, 30004158]