A333758 - cp's OEIS frontend

A333758 Square array T(n,k), n >= 2, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding closed paths in the n X k grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.

n	a(n)
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	3
10	3
11	1
12	1
13	5
14	11
15	5
16	1
17	1
18	11
19	36
20	36
21	11
22	1
23	1
24	21
25	122
26	191
27	122
28	21
29	1
30	1
31	43
32	408
33	1123
34	1123
35	408
36	43
37	1
38	1
39	85
40	1371
41	6410
42	11346
43	6410
44	1371
45	85
46	1
47	1
48	171
49	4599
50	37165
51	113748
52	113748
53	37165
54	4599
55	171
56	1

[1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 5, 11, 5, 1, 1, 11, 36, 36, 11, 1, 1, 21, 122, 191, 122, 21, 1, 1, 43, 408, 1123, 1123, 408, 43, 1, 1, 85, 1371, 6410, 11346, 6410, 1371, 85, 1, 1, 171, 4599, 37165, 113748, 113748, 37165, 4599, 171, 1]

cp's OEIS Frontend

A333758 Square array T(n,k), n >= 2, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding closed paths in the n X k grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph.

Table of values

List of values