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.

A222587 T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 4
8 5
9 5
10 4
11 5
12 18
13 9
14 18
15 5
16 14
17 59
18 112
19 112
20 59
21 14
22 17
23 200
24 426
25 1087
26 426
27 200
28 17
29 70
30 820
31 4790
32 11442
33 11442
34 4790
35 820
36 70
37 89
38 3014
39 18007
40 128213
41 111951
42 128213
43 18007
44 3014
45 89
46 326
47 11364
48 208768
49 1471412
50 3778560
51 3778560
52 1471412

List of values

[1, 1, 1, 1, 1, 1, 4, 5, 5, 4, 5, 18, 9, 18, 5, 14, 59, 112, 112, 59, 14, 17, 200, 426, 1087, 426, 200, 17, 70, 820, 4790, 11442, 11442, 4790, 820, 70, 89, 3014, 18007, 128213, 111951, 128213, 18007, 3014, 89, 326, 11364, 208768, 1471412, 3778560, 3778560, 1471412]