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.

A378938 Array read by antidiagonals: T(m,n) is the number of Hamiltonian paths in an m X n grid which start in the top left corner.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 3
9 3
10 1
11 1
12 4
13 8
14 4
15 1
16 1
17 5
18 17
19 17
20 5
21 1
22 1
23 6
24 38
25 52
26 38
27 6
28 1
29 1
30 7
31 78
32 160
33 160
34 78
35 7
36 1
37 1
38 8
39 164
40 469
41 824
42 469
43 164
44 8
45 1
46 1
47 9
48 332
49 1337
50 3501
51 3501
52 1337
53 332
54 9
55 1
56 1
57 10
58 680
59 3750
60 16262
61 22144
62 16262
63 3750
64 680
65 10
66 1

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 8, 4, 1, 1, 5, 17, 17, 5, 1, 1, 6, 38, 52, 38, 6, 1, 1, 7, 78, 160, 160, 78, 7, 1, 1, 8, 164, 469, 824, 469, 164, 8, 1, 1, 9, 332, 1337, 3501, 3501, 1337, 332, 9, 1, 1, 10, 680, 3750, 16262, 22144, 16262, 3750, 680, 10, 1]