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.

A207997 T(n,k) = number of n X k 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any horizontal or vertical neighbor (colorings ignoring permutations of colors).

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 3
6 2
7 4
8 9
9 9
10 4
11 8
12 27
13 41
14 27
15 8
16 16
17 81
18 187
19 187
20 81
21 16
22 32
23 243
24 853
25 1302
26 853
27 243
28 32
29 64
30 729
31 3891
32 9075
33 9075
34 3891
35 729
36 64
37 128
38 2187
39 17749
40 63267
41 96831
42 63267
43 17749
44 2187
45 128
46 256
47 6561
48 80963
49 441090
50 1034073
51 1034073
52 441090
53 80963

List of values

[1, 1, 1, 2, 3, 2, 4, 9, 9, 4, 8, 27, 41, 27, 8, 16, 81, 187, 187, 81, 16, 32, 243, 853, 1302, 853, 243, 32, 64, 729, 3891, 9075, 9075, 3891, 729, 64, 128, 2187, 17749, 63267, 96831, 63267, 17749, 2187, 128, 256, 6561, 80963, 441090, 1034073, 1034073, 441090, 80963]