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.

A222509 T(n,k)=Number of nXk 0..1 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal 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 0
11 4
12 3
13 4
14 11
15 0
16 4
17 10
18 15
19 35
20 8
21 0
22 5
23 32
24 35
25 84
26 87
27 44
28 0
29 20
30 44
31 170
32 423
33 497
34 496
35 144
36 0
37 27
38 176
39 441
40 1753
41 2066
42 2862
43 1335
44 352
45 0
46 48
47 326
48 2192
49 8489
50 17674
51 23678
52 15420
53 7552
54 692
55 0
56 63
57 888
58 5416
59 39873
60 81537
61 195968
62 128889

List of values

[1, 0, 0, 0, 0, 0, 3, 4, 4, 0, 4, 3, 4, 11, 0, 4, 10, 15, 35, 8, 0, 5, 32, 35, 84, 87, 44, 0, 20, 44, 170, 423, 497, 496, 144, 0, 27, 176, 441, 1753, 2066, 2862, 1335, 352, 0, 48, 326, 2192, 8489, 17674, 23678, 15420, 7552, 692, 0, 63, 888, 5416, 39873, 81537, 195968, 128889]