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.

A222456 T(n,k) = Number of n X k 0..1 arrays with exactly floor(n X k/2) elements unequal to at least one horizontal, vertical 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 2
9 2
10 3
11 4
12 7
13 2
14 7
15 4
16 4
17 10
18 17
19 17
20 10
21 4
22 5
23 23
24 27
25 101
26 27
27 23
28 5
29 20
30 64
31 194
32 426
33 426
34 194
35 64
36 20
37 27
38 175
39 467
40 1722
41 1847
42 1722
43 467
44 175
45 27
46 48
47 400
48 2375
49 8483
50 16440
51 16440
52 8483
53 2375
54 400
55 48
56 63
57 983
58 6320
59 46788
60 84558
61 161779
62 84558

List of values

[1, 0, 0, 0, 0, 0, 3, 2, 2, 3, 4, 7, 2, 7, 4, 4, 10, 17, 17, 10, 4, 5, 23, 27, 101, 27, 23, 5, 20, 64, 194, 426, 426, 194, 64, 20, 27, 175, 467, 1722, 1847, 1722, 467, 175, 27, 48, 400, 2375, 8483, 16440, 16440, 8483, 2375, 400, 48, 63, 983, 6320, 46788, 84558, 161779, 84558]