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.

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

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 7
6 1
7 5
8 21
9 22
10 1
11 8
12 87
13 125
14 71
15 1
16 13
17 317
18 1189
19 765
20 228
21 1
22 21
23 1215
24 9176
25 17084
26 4657
27 733
28 1
29 34
30 4565
31 76955
32 282777
33 243119
34 28373
35 2356
36 1
37 55
38 17287
39 624227
40 5280827
41 8608738
42 3466455
43 172833
44 7573
45 1
46 89
47 65261
48 5131406
49 93905509

List of values

[1, 2, 1, 3, 7, 1, 5, 21, 22, 1, 8, 87, 125, 71, 1, 13, 317, 1189, 765, 228, 1, 21, 1215, 9176, 17084, 4657, 733, 1, 34, 4565, 76955, 282777, 243119, 28373, 2356, 1, 55, 17287, 624227, 5280827, 8608738, 3466455, 172833, 7573, 1, 89, 65261, 5131406, 93905509]