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.

A220688 T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal, vertical or antidiagonal neighbors.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 4
6 1
7 1
8 12
9 12
10 1
11 1
12 37
13 94
14 37
15 1
16 1
17 114
18 745
19 745
20 114
21 1
22 1
23 351
24 5851
25 15452
26 5851
27 351
28 1
29 1
30 1081
31 46027
32 312603
33 312603
34 46027
35 1081
36 1
37 1
38 3329
39 362057
40 6349886
41 15978924
42 6349886
43 362057
44 3329
45 1
46 1
47 10252
48 2847943
49 128995678

List of values

[1, 1, 1, 1, 4, 1, 1, 12, 12, 1, 1, 37, 94, 37, 1, 1, 114, 745, 745, 114, 1, 1, 351, 5851, 15452, 5851, 351, 1, 1, 1081, 46027, 312603, 312603, 46027, 1081, 1, 1, 3329, 362057, 6349886, 15978924, 6349886, 362057, 3329, 1, 1, 10252, 2847943, 128995678]