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.

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

Table of values

n a(n)
1 0
2 1
3 0
4 2
5 4
6 0
7 5
8 8
9 15
10 0
11 10
12 36
13 46
14 48
15 0
16 20
17 88
18 305
19 224
20 145
21 0
22 38
23 272
24 1078
25 2136
26 1066
27 420
28 0
29 71
30 696
31 4948
32 10976
33 14240
34 4952
35 1183
36 0
37 130
38 1900
39 18210
40 73568
41 109058
42 91048
43 22654
44 3264
45 0
46 235
47 4856
48 73277
49 390064
50 1049588
51 1053432
52 566656

List of values

[0, 1, 0, 2, 4, 0, 5, 8, 15, 0, 10, 36, 46, 48, 0, 20, 88, 305, 224, 145, 0, 38, 272, 1078, 2136, 1066, 420, 0, 71, 696, 4948, 10976, 14240, 4952, 1183, 0, 130, 1900, 18210, 73568, 109058, 91048, 22654, 3264, 0, 235, 4856, 73277, 390064, 1049588, 1053432, 566656]