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.
%I A160241 #25 Dec 21 2024 16:26:08 %S A160241 1,7,164,1337,16262,144476,1510446,13506023,132712481,1185979605, %T A160241 11264671456,100572103736,935551716239,8347069749600,76604373779441, %U A160241 683160282998544,6213169249692192,55392188422262591,500676083630457127,4462726297606450762,40165465812088131228,357958181000067374304 %N A160241 Number of Greek-key tours on a 7 X n grid. %C A160241 Greek-key tours are self-avoiding walks that touch every vertex of the grid and start at the bottom-left corner. %C A160241 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 A160241 Andrew Howroyd, <a href="/A160241/b160241.txt">Table of n, a(n) for n = 1..500</a> %H A160241 Nathaniel Johnston, <a href="http://www.nathanieljohnston.com/index.php/2009/05/on-maximal-self-avoiding-walks/">On Maximal Self-Avoiding Walks</a>. %H A160241 Jay Pantone, <a href="/A160241/a160241.txt">Generating function</a>. %H A160241 Jay Pantone, Alexander R. Klotz, and Everett Sullivan, <a href="https://arxiv.org/abs/2407.18205">Exactly-solvable self-trapping lattice walks. II. Lattices of arbitrary height</a>, arXiv:2407.18205 [math.CO], 2024. See p. 31. %H A160241 <a href="/index/Rec#order_71">Index entries for linear recurrences with constant coefficients</a>, order 71. %F A160241 See Links section for generating function. _Jay Pantone_, Aug 06 2024 %Y A160241 Row 7 of A378938. %Y A160241 Cf. A046994, A046995, A145156, A145157. %K A160241 nonn %O A160241 1,2 %A A160241 _Nathaniel Johnston_, May 05 2009 %E A160241 a(11) onwards from _Andrew Howroyd_, Nov 07 2015