|
%I #14 Jan 01 2019 06:31:05
%S 1,7,164,1337,16262,144476,1510446,13506023,132712481,1185979605,
%T 11264671456,100572103736,935551716239,8347069749600,76604373779441,
%U 683160282998544,6213169249692192,55392188422262591,500676083630457127,4462726297606450762,40165465812088131228,357958181000067374304,3212099862174948821718,28623565473267451344466,256312533945178149983147,2283878397650977479239903,20420964710002966369773032,181952098315164452547737813,1625193628709305194920610168,14480051230931926406392771755
%N Number of Greek Key Tours on a 7 X n grid.
%C Greek Key Tours are self-avoiding walks that touch every vertex of the grid and start at the bottom-left corner.
%C The sequence may be enumerated using standard methods for counting Hamiltonian cycles on a modified graph with two additional nodes, one joined to a corner vertex and the other joined to all other vertices. - _Andrew Howroyd_, Nov 07 2015
%H N. Johnston, <a href="http://www.nathanieljohnston.com/index.php/2009/05/on-maximal-self-avoiding-walks/">On Maximal Self-Avoiding Walks</a>.
%Y Cf. A046994, A046995, A145156, A145157.
%K nonn
%O 1,2
%A _Nathaniel Johnston_, May 05 2009
%E a(11)-a(30) from _Andrew Howroyd_, Nov 07 2015
|
