|
%I #20 Aug 16 2022 05:40:32
%S 8,95,2320,154259,30549774,17777600753,30283708455564,
%T 152480475641255213,2287842813828061810244,
%U 102744826737618542833764649,13848270995235582268846758977770
%N "Spanning walks" on the square lattice (see Jensen web site for further information).
%C Number of Hamiltonian paths in the graph P_{n+1} X P_{n+1} starting at any of the n+1 vertices on one side of the graph and terminating at any of the n+1 vertices on the opposite side. - _Andrew Howroyd_, Apr 10 2016
%H Anthony J. Guttmann and Iwan Jensen, <a href="/A121785/b121785.txt">Table of n, a(n) for n = 1..26</a>
%H Anthony J. Guttmann and Iwan Jensen, <a href="https://arxiv.org/abs/2208.06744">Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices</a>, arXiv:2208.06744 [math-ph], Aug 13 2022, table D1.
%H I. Jensen, <a href="https://web.archive.org/web/20070612141707/http://www.ms.unimelb.edu.au/~iwan/saw/SAW_ser.html">Series Expansions for Self-Avoiding Walks</a>
%H I. Jensen, <a href="https://web.archive.org/web/20070613021659/http://www.ms.unimelb.edu.au/~iwan/saw/series/saw_span.ser">Spanning walks (terms)</a>
%Y Cf. A000532, A001184, A121789, A215527.
%Y Cf. A333323, A356610-A356616, A354511.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Aug 30 2006
| 