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.

A208353 T(n,k) is the number of n X k 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).

Table of values

n a(n)
1 1
2 2
3 2
4 5
5 15
6 5
7 15
8 100
9 100
10 15
11 51
12 868
13 1095
14 868
15 51
16 187
17 7780
18 12625
19 12625
20 7780
21 187
22 715
23 69988
24 153237
25 230387
26 153237
27 69988
28 715
29 2795
30 629860
31 1901508
32 4773885
33 4773885
34 1901508
35 629860
36 2795
37 11051
38 5668708
39 23658861
40 103672036

List of values

[1, 2, 2, 5, 15, 5, 15, 100, 100, 15, 51, 868, 1095, 868, 51, 187, 7780, 12625, 12625, 7780, 187, 715, 69988, 153237, 230387, 153237, 69988, 715, 2795, 629860, 1901508, 4773885, 4773885, 1901508, 629860, 2795, 11051, 5668708, 23658861, 103672036]