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.

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

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 6
6 2
7 5
8 15
9 15
10 5
11 10
12 44
13 56
14 44
15 10
16 20
17 105
18 223
19 223
20 105
21 20
22 38
23 258
24 762
25 1148
26 762
27 258
28 38
29 71
30 595
31 2607
32 5170
33 5170
34 2607
35 595
36 71
37 130
38 1368
39 8500
40 23156
41 32056
42 23156
43 8500
44 1368
45 130
46 235
47 3069
48 27411
49 99057
50 193573
51 193573
52 99057

List of values

[0, 1, 1, 2, 6, 2, 5, 15, 15, 5, 10, 44, 56, 44, 10, 20, 105, 223, 223, 105, 20, 38, 258, 762, 1148, 762, 258, 38, 71, 595, 2607, 5170, 5170, 2607, 595, 71, 130, 1368, 8500, 23156, 32056, 23156, 8500, 1368, 130, 235, 3069, 27411, 99057, 193573, 193573, 99057]