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.

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

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 5
6 2
7 5
8 17
9 17
10 5
11 10
12 48
13 72
14 48
15 10
16 20
17 131
18 302
19 302
20 131
21 20
22 38
23 338
24 1144
25 1714
26 1144
27 338
28 38
29 71
30 850
31 4207
32 9085
33 9085
34 4207
35 850
36 71
37 130
38 2091
39 14984
40 46195
41 67100
42 46195
43 14984
44 2091
45 130
46 235
47 5061
48 52335
49 228384
50 477128
51 477128
52 228384

List of values

[0, 1, 1, 2, 5, 2, 5, 17, 17, 5, 10, 48, 72, 48, 10, 20, 131, 302, 302, 131, 20, 38, 338, 1144, 1714, 1144, 338, 38, 71, 850, 4207, 9085, 9085, 4207, 850, 71, 130, 2091, 14984, 46195, 67100, 46195, 14984, 2091, 130, 235, 5061, 52335, 228384, 477128, 477128, 228384]