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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 2
9 1
10 1
11 1
12 3
13 3
14 1
15 1
16 1
17 5
18 6
19 5
20 1
21 1
22 1
23 8
24 12
25 13
26 8
27 1
28 1
29 1
30 13
31 24
32 37
33 28
34 13
35 1
36 1
37 1
38 21
39 48
40 105
41 107
42 60
43 21
44 1
45 1
46 1
47 34
48 96
49 298
50 405
51 317
52 129
53 34
54 1
55 1
56 1
57 55
58 192
59 846
60 1520
61 1617
62 932
63 277
64 55
65 1
66 1
67 1
68 89
69 384
70 2404
71 5706
72 8338
73 6412
74 2749
75 595

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 1, 5, 6, 5, 1, 1, 1, 8, 12, 13, 8, 1, 1, 1, 13, 24, 37, 28, 13, 1, 1, 1, 21, 48, 105, 107, 60, 21, 1, 1, 1, 34, 96, 298, 405, 317, 129, 34, 1, 1, 1, 55, 192, 846, 1520, 1617, 932, 277, 55, 1, 1, 1, 89, 384, 2404, 5706, 8338, 6412, 2749, 595]