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.

A222479 T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..3 order.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 4
8 1
9 1
10 4
11 5
12 10
13 5
14 10
15 5
16 14
17 11
18 42
19 42
20 11
21 14
22 17
23 126
24 45
25 235
26 45
27 126
28 17
29 75
30 139
31 1582
32 1450
33 1450
34 1582
35 139
36 75
37 95
38 2033
39 2953
40 30883
41 11994
42 30883
43 2953
44 2033
45 95
46 411
47 2229
48 104833
49 267772
50 574388
51 574388
52 267772
53 104833
54 2229

List of values

[1, 1, 1, 1, 1, 1, 4, 1, 1, 4, 5, 10, 5, 10, 5, 14, 11, 42, 42, 11, 14, 17, 126, 45, 235, 45, 126, 17, 75, 139, 1582, 1450, 1450, 1582, 139, 75, 95, 2033, 2953, 30883, 11994, 30883, 2953, 2033, 95, 411, 2229, 104833, 267772, 574388, 574388, 267772, 104833, 2229]