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.

A333571 Square array T(n,k), n >= 1, k >= 2, read by antidiagonals, where T(n,k) is the number of Hamiltonian paths in the n X k grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 4
7 1
8 2
9 8
10 6
11 1
12 2
13 16
14 14
15 10
16 1
17 2
18 32
19 34
20 38
21 14
22 1
23 2
24 64
25 80
26 162
27 74
28 20
29 1
30 2
31 128
32 190
33 650
34 426
35 170
36 26
37 1
38 2
39 256
40 450
41 2728
42 2166
43 1594
44 338
45 34
46 1
47 2
48 512
49 1066
50 11250
51 12014
52 12908
53 4374
54 724
55 42
56 1
57 2
58 1024
59 2526
60 46984
61 62714
62 119364
63 47738
64 14640
65 1448
66 52

List of values

[1, 1, 2, 1, 2, 4, 1, 2, 8, 6, 1, 2, 16, 14, 10, 1, 2, 32, 34, 38, 14, 1, 2, 64, 80, 162, 74, 20, 1, 2, 128, 190, 650, 426, 170, 26, 1, 2, 256, 450, 2728, 2166, 1594, 338, 34, 1, 2, 512, 1066, 11250, 12014, 12908, 4374, 724, 42, 1, 2, 1024, 2526, 46984, 62714, 119364, 47738, 14640, 1448, 52]