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.

A220614 T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal and vertical neighbors, without consecutive collinear links.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 3
9 3
10 1
11 1
12 5
13 5
14 5
15 1
16 1
17 8
18 11
19 11
20 8
21 1
22 1
23 13
24 21
25 36
26 21
27 13
28 1
29 1
30 21
31 43
32 95
33 95
34 43
35 21
36 1
37 1
38 34
39 85
40 281
41 324
42 281
43 85
44 34
45 1
46 1
47 55
48 171
49 781
50 1277
51 1277
52 781
53 171
54 55
55 1
56 1
57 89
58 341
59 2245
60 4673
61 7041
62 4673
63 2245
64 341
65 89
66 1
67 1
68 144
69 683
70 6336

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 5, 5, 1, 1, 8, 11, 11, 8, 1, 1, 13, 21, 36, 21, 13, 1, 1, 21, 43, 95, 95, 43, 21, 1, 1, 34, 85, 281, 324, 281, 85, 34, 1, 1, 55, 171, 781, 1277, 1277, 781, 171, 55, 1, 1, 89, 341, 2245, 4673, 7041, 4673, 2245, 341, 89, 1, 1, 144, 683, 6336]