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.

A220602 T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal, vertical and antidiagonal neighbors, without 3-loops.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 7
9 7
10 1
11 1
12 17
13 65
14 17
15 1
16 1
17 44
18 471
19 471
20 44
21 1
22 1
23 117
24 3469
25 9047
26 3469
27 117
28 1
29 1
30 305
31 25747
32 167614
33 167614
34 25747
35 305
36 1
37 1
38 798
39 190425
40 3174778
41 7558495
42 3174778
43 190425
44 798
45 1
46 1
47 2091
48 1408823
49 60138423
50 352586943

List of values

[1, 1, 1, 1, 2, 1, 1, 7, 7, 1, 1, 17, 65, 17, 1, 1, 44, 471, 471, 44, 1, 1, 117, 3469, 9047, 3469, 117, 1, 1, 305, 25747, 167614, 167614, 25747, 305, 1, 1, 798, 190425, 3174778, 7558495, 3174778, 190425, 798, 1, 1, 2091, 1408823, 60138423, 352586943]