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.

A333580 Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) is the number of Hamiltonian paths in an n X k grid starting at the lower left corner and finishing in the upper right corner.

Table of values

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

List of values

[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 2, 0, 1, 1, 1, 4, 4, 1, 1, 1, 0, 8, 0, 8, 0, 1, 1, 1, 16, 20, 20, 16, 1, 1, 1, 0, 32, 0, 104, 0, 32, 0, 1, 1, 1, 64, 111, 378, 378, 111, 64, 1, 1, 1, 0, 128, 0, 1670, 0, 1670, 0, 128, 0, 1, 1, 1, 256, 624, 6706, 10204, 10204, 6706, 624, 256, 1, 1]