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.

A221273 T(n,k) is the number of n X k arrays of occupancy after each element moves to some king-move neighbor, with every occupancy equal to zero or two.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 6
6 0
7 1
8 16
9 16
10 1
11 0
12 52
13 0
14 52
15 0
16 0
17 174
18 596
19 596
20 174
21 0
22 0
23 588
24 0
25 7252
26 0
27 588
28 0
29 1
30 1984
31 24366
32 94659
33 94659
34 24366
35 1984
36 1
37 0
38 6688
39 0
40 1250015
41 0
42 1250015
43 0
44 6688
45 0
46 0
47 22536
48 1001855
49 16474842
50 64221682
51 64221682
52 16474842
53 1001855

List of values

[0, 0, 0, 0, 6, 0, 1, 16, 16, 1, 0, 52, 0, 52, 0, 0, 174, 596, 596, 174, 0, 0, 588, 0, 7252, 0, 588, 0, 1, 1984, 24366, 94659, 94659, 24366, 1984, 1, 0, 6688, 0, 1250015, 0, 1250015, 0, 6688, 0, 0, 22536, 1001855, 16474842, 64221682, 64221682, 16474842, 1001855]