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.

A199133 T(n,k)=Number of nXk 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 3
8 2
9 2
10 3
11 6
12 12
13 6
14 12
15 6
16 5
17 30
18 19
19 19
20 30
21 5
22 19
23 30
24 70
25 258
26 70
27 30
28 19
29 37
30 210
31 264
32 1409
33 1409
34 264
35 210
36 37
37 29
38 560
39 1038
40 2836
41 11475
42 2836
43 1038
44 560
45 29
46 124
47 560
48 4155
49 48320
50 33970
51 33970
52 48320
53 4155
54 560
55 124
56 240
57 4200
58 16896
59 295092

List of values

[1, 1, 1, 1, 2, 1, 3, 2, 2, 3, 6, 12, 6, 12, 6, 5, 30, 19, 19, 30, 5, 19, 30, 70, 258, 70, 30, 19, 37, 210, 264, 1409, 1409, 264, 210, 37, 29, 560, 1038, 2836, 11475, 2836, 1038, 560, 29, 124, 560, 4155, 48320, 33970, 33970, 48320, 4155, 560, 124, 240, 4200, 16896, 295092]