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.

A221028 T(n,k) = Sum of neighbor maps: log base 2 of the number of n X k binary arrays indicating the locations of corresponding elements equal to the sum mod 2 of their horizontal, vertical and antidiagonal neighbors in a random 0..1 n X k array.

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 3
6 3
7 4
8 6
9 6
10 4
11 4
12 6
13 7
14 6
15 4
16 6
17 10
18 11
19 11
20 10
21 6
22 7
23 11
24 14
25 16
26 14
27 11
28 7
29 7
30 13
31 17
32 20
33 20
34 17
35 13
36 7
37 9
38 16
39 19
40 21
41 24
42 21
43 19
44 16
45 9
46 10
47 16
48 24
49 27
50 30
51 30
52 27
53 24
54 16
55 10
56 10
57 20
58 27
59 31
60 35
61 33
62 35
63 31
64 27
65 20
66 10
67 12
68 21
69 30
70 33
71 40
72 42
73 42
74 40
75 33
76 30
77 21
78 12
79 13

List of values

[1, 1, 1, 3, 3, 3, 4, 6, 6, 4, 4, 6, 7, 6, 4, 6, 10, 11, 11, 10, 6, 7, 11, 14, 16, 14, 11, 7, 7, 13, 17, 20, 20, 17, 13, 7, 9, 16, 19, 21, 24, 21, 19, 16, 9, 10, 16, 24, 27, 30, 30, 27, 24, 16, 10, 10, 20, 27, 31, 35, 33, 35, 31, 27, 20, 10, 12, 21, 30, 33, 40, 42, 42, 40, 33, 30, 21, 12, 13]