A374307 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A374307

Number of Greek Key Tours on an 8 X n grid.

1, 8, 332, 3750, 68591, 899432, 13506023, 180160012, 2510785227, 33330848454, 448079715759, 5893418278271, 77649390052196, 1011970457365017, 13165754032331389, 170232985496817728, 2195480228590892060, 28203099820000893198, 361391865363036263917

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Greek Key Tours are self-avoiding walks that touch every vertex of the grid and start at the bottom-left corner.

LINKS

Table of n, a(n) for n=1..19.

N. Johnston, On Maximal Self-Avoiding Walks.

Jay Pantone, Generating function.

Jay Pantone, Alexander R. Klotz, and Everett Sullivan, Exactly-solvable self-trapping lattice walks. II. Lattices of arbitrary height., arXiv:2407.18205 [math.CO], 2024.

FORMULA

See Links section for generating function.