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.

A220644 T(n,k) = number of ways to reciprocally link elements of an n X k array either to themselves or to exactly one king-move neighbor.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 10
6 3
7 5
8 40
9 40
10 5
11 8
12 172
13 369
14 172
15 8
16 13
17 728
18 3755
19 3755
20 728
21 13
22 21
23 3096
24 37320
25 92801
26 37320
27 3096
28 21
29 34
30 13152
31 373177
32 2226936
33 2226936
34 373177
35 13152
36 34
37 55
38 55888
39 3725843
40 53841725
41 128171936
42 53841725
43 3725843
44 55888
45 55
46 89

List of values

[1, 2, 2, 3, 10, 3, 5, 40, 40, 5, 8, 172, 369, 172, 8, 13, 728, 3755, 3755, 728, 13, 21, 3096, 37320, 92801, 37320, 3096, 21, 34, 13152, 373177, 2226936, 2226936, 373177, 13152, 34, 55, 55888, 3725843, 53841725, 128171936, 53841725, 3725843, 55888, 55, 89]