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.

A220562 T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly one horizontal or antidiagonal neighbor.

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 5
6 1
7 5
8 14
9 13
10 1
11 8
12 47
13 64
14 34
15 1
16 13
17 149
18 430
19 292
20 89
21 1
22 21
23 481
24 2604
25 3966
26 1332
27 233
28 1
29 34
30 1544
31 16310
32 45966
33 36640
34 6076
35 610
36 1
37 55
38 4965
39 101052
40 561636
41 810778
42 338581
43 27716
44 1597
45 1
46 89
47 15957
48 628269
49 6743873
50 19333688
51 14298089

List of values

[1, 2, 1, 3, 5, 1, 5, 14, 13, 1, 8, 47, 64, 34, 1, 13, 149, 430, 292, 89, 1, 21, 481, 2604, 3966, 1332, 233, 1, 34, 1544, 16310, 45966, 36640, 6076, 610, 1, 55, 4965, 101052, 561636, 810778, 338581, 27716, 1597, 1, 89, 15957, 628269, 6743873, 19333688, 14298089]