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.

A222290 T(n,k)=Number of nXk 0..1 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..1 order.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 0
6 0
7 3
8 4
9 4
10 3
11 4
12 11
13 4
14 11
15 4
16 4
17 8
18 35
19 35
20 8
21 4
22 5
23 44
24 83
25 208
26 83
27 44
28 5
29 20
30 144
31 532
32 1125
33 1125
34 532
35 144
36 20
37 27
38 352
39 1427
40 6619
41 6582
42 6619
43 1427
44 352
45 27
46 48
47 692
48 8540
49 40321
50 89852
51 89852
52 40321
53 8540
54 692
55 48
56 63
57 2488
58 23798
59 250681

List of values

[1, 0, 0, 0, 0, 0, 3, 4, 4, 3, 4, 11, 4, 11, 4, 4, 8, 35, 35, 8, 4, 5, 44, 83, 208, 83, 44, 5, 20, 144, 532, 1125, 1125, 532, 144, 20, 27, 352, 1427, 6619, 6582, 6619, 1427, 352, 27, 48, 692, 8540, 40321, 89852, 89852, 40321, 8540, 692, 48, 63, 2488, 23798, 250681]