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.

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

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 1
6 5
7 4
8 5
9 5
10 15
11 5
12 10
13 11
14 18
15 51
16 14
17 25
18 58
19 130
20 63
21 187
22 17
23 150
24 142
25 527
26 670
27 234
28 715
29 75
30 359
31 2398
32 5374
33 8276
34 9587
35 1163
36 2795
37 95
38 2249
39 6463
40 58167
41 69973
42 133028
43 51055
44 4953
45 11051
46 411
47 6511
48 146947
49 687222
50 1999404
51 3759625

List of values

[1, 1, 2, 1, 1, 5, 4, 5, 5, 15, 5, 10, 11, 18, 51, 14, 25, 58, 130, 63, 187, 17, 150, 142, 527, 670, 234, 715, 75, 359, 2398, 5374, 8276, 9587, 1163, 2795, 95, 2249, 6463, 58167, 69973, 133028, 51055, 4953, 11051, 411, 6511, 146947, 687222, 1999404, 3759625]