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.

A342936 Array T(n, k), n, k > 0, read by antidiagonals; T(n, k) is the number of rotationally symmetric self-avoiding rook paths joining opposite corners of an n X k board.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 0
5 1
6 1
7 2
8 2
9 1
10 1
11 0
12 4
13 0
14 1
15 1
16 4
17 6
18 6
19 4
20 1
21 1
22 0
23 13
24 0
25 13
26 0
27 1
28 1
29 8
30 20
31 34
32 34
33 20
34 8
35 1
36 1
37 0
38 43
39 0
40 120
41 0
42 43
43 0
44 1
45 1
46 16
47 66
48 187
49 320
50 320
51 187
52 66
53 16
54 1
55 1
56 0
57 142
58 0
59 1137
60 0
61 1137
62 0
63 142
64 0
65 1
66 1
67 32
68 218
69 1026
70 3026
71 5321
72 5321
73 3026
74 1026
75 218
76 32
77 1

List of values

[1, 1, 1, 1, 0, 1, 1, 2, 2, 1, 1, 0, 4, 0, 1, 1, 4, 6, 6, 4, 1, 1, 0, 13, 0, 13, 0, 1, 1, 8, 20, 34, 34, 20, 8, 1, 1, 0, 43, 0, 120, 0, 43, 0, 1, 1, 16, 66, 187, 320, 320, 187, 66, 16, 1, 1, 0, 142, 0, 1137, 0, 1137, 0, 142, 0, 1, 1, 32, 218, 1026, 3026, 5321, 5321, 3026, 1026, 218, 32, 1]