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.

A183368 T(n,k)=Number of nXk binary arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.

Table of values

n a(n)
1 1
2 2
3 2
4 2
5 3
6 2
7 3
8 5
9 5
10 3
11 4
12 12
13 18
14 12
15 4
16 5
17 21
18 39
19 39
20 21
21 5
22 7
23 41
24 108
25 138
26 108
27 41
28 7
29 9
30 84
31 288
32 548
33 548
34 288
35 84
36 9
37 12
38 171
39 795
40 2129
41 3102
42 2129
43 795
44 171
45 12
46 16
47 355
48 2278
49 8311
50 17101
51 17101
52 8311
53 2278
54 355
55 16
56 21
57 732
58 6438
59 32933
60 95674
61 137688

List of values

[1, 2, 2, 2, 3, 2, 3, 5, 5, 3, 4, 12, 18, 12, 4, 5, 21, 39, 39, 21, 5, 7, 41, 108, 138, 108, 41, 7, 9, 84, 288, 548, 548, 288, 84, 9, 12, 171, 795, 2129, 3102, 2129, 795, 171, 12, 16, 355, 2278, 8311, 17101, 17101, 8311, 2278, 355, 16, 21, 732, 6438, 32933, 95674, 137688]