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.

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

List of values

[1, 1, 1, 3, 4, 3, 4, 4, 4, 4, 4, 8, 9, 8, 4, 6, 9, 12, 12, 9, 6, 7, 12, 12, 12, 12, 12, 7, 7, 12, 18, 20, 20, 18, 12, 7, 9, 16, 21, 24, 23, 24, 21, 16, 9, 10, 17, 22, 28, 30, 30, 28, 22, 17, 10, 10, 20, 27, 32, 31, 36, 31, 32, 27, 20, 10, 12, 20, 30, 32, 39, 42, 42, 39, 32, 30, 20, 12, 13, 24]