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.

A222328 T(n,k)=Number of nXk 0..1 arrays with exactly floor(nXk/2) elements unequal to at least one king-move 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 0
9 0
10 3
11 4
12 7
13 4
14 7
15 4
16 4
17 0
18 19
19 19
20 0
21 4
22 5
23 32
24 0
25 52
26 0
27 32
28 5
29 20
30 0
31 84
32 165
33 165
34 84
35 0
36 20
37 27
38 168
39 212
40 835
41 674
42 835
43 212
44 168
45 27
46 48
47 0
48 1366
49 3307
50 3770
51 3770
52 3307
53 1366
54 0
55 48
56 63
57 948
58 1302
59 14419
60 15100
61 38238
62 15100
63 14419
64 1302
65 948

List of values

[1, 0, 0, 0, 0, 0, 3, 0, 0, 3, 4, 7, 4, 7, 4, 4, 0, 19, 19, 0, 4, 5, 32, 0, 52, 0, 32, 5, 20, 0, 84, 165, 165, 84, 0, 20, 27, 168, 212, 835, 674, 835, 212, 168, 27, 48, 0, 1366, 3307, 3770, 3770, 3307, 1366, 0, 48, 63, 948, 1302, 14419, 15100, 38238, 15100, 14419, 1302, 948]