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.

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

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 4
13 3
14 1
15 1
16 1
17 8
18 12
19 5
20 1
21 1
22 1
23 16
24 44
25 37
26 8
27 1
28 1
29 1
30 32
31 158
32 257
33 114
34 13
35 1
36 1
37 1
38 64
39 564
40 1665
41 1481
42 351
43 21
44 1
45 1
46 1
47 128
48 2010
49 10695
50 17527
51 8560
52 1081
53 34
54 1
55 1
56 1
57 256
58 7160
59 68637
60 201903
61 183961
62 49448
63 3329
64 55
65 1
66 1
67 1
68 512

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 1, 8, 12, 5, 1, 1, 1, 16, 44, 37, 8, 1, 1, 1, 32, 158, 257, 114, 13, 1, 1, 1, 64, 564, 1665, 1481, 351, 21, 1, 1, 1, 128, 2010, 10695, 17527, 8560, 1081, 34, 1, 1, 1, 256, 7160, 68637, 201903, 183961, 49448, 3329, 55, 1, 1, 1, 512]