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.

A268886 T(n,k)=Number of nXk binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.

Table of values

n a(n)
1 0
2 1
3 0
4 2
5 5
6 0
7 5
8 14
9 20
10 0
11 10
12 54
13 84
14 71
15 0
16 20
17 158
18 501
19 462
20 235
21 0
22 38
23 475
24 2190
25 4133
26 2418
27 744
28 0
29 71
30 1340
31 9996
32 27130
33 31956
34 12252
35 2285
36 0
37 130
38 3740
39 42362
40 186732
41 317966
42 236960
43 60666
44 6865
45 0
46 235
47 10204
48 178400
49 1187838
50 3283890

List of values

[0, 1, 0, 2, 5, 0, 5, 14, 20, 0, 10, 54, 84, 71, 0, 20, 158, 501, 462, 235, 0, 38, 475, 2190, 4133, 2418, 744, 0, 71, 1340, 9996, 27130, 31956, 12252, 2285, 0, 130, 3740, 42362, 186732, 317966, 236960, 60666, 6865, 0, 235, 10204, 178400, 1187838, 3283890]