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 A160240 #27 Dec 21 2024 16:26:44 %S A160240 1,6,78,469,3501,22144,144476,899432,5585508,34092855,206571444, %T A160240 1241016042,7407467656,43975776229,259779839242,1528563721468, %U A160240 8960651209082,52368047294410,305173796833144,1774059940879290,10289839706255591,59564855651625602,344177608427972004,1985502681113986836 %N A160240 Number of Greek-key tours on a 6 X n grid. %C A160240 Greek-key tours are self-avoiding walks that touch every vertex of the grid and start at the bottom-left corner. %C A160240 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 A160240 Andrew Howroyd, <a href="/A160240/b160240.txt">Table of n, a(n) for n = 1..500</a> %H A160240 Nathaniel Johnston, <a href="http://www.nathanieljohnston.com/index.php/2009/05/on-maximal-self-avoiding-walks/">On Maximal Self-Avoiding Walks</a>. %H A160240 Jay Pantone, <a href="/A160240/a160240.txt">Generating function</a>. %H A160240 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. 30. %H A160240 <a href="/index/Rec#order_37">Index entries for linear recurrences with constant coefficients</a>, order 37. %F A160240 See Links section for generating function. - _Jay Pantone_, Aug 01 2024 %Y A160240 Row 6 of A378938. %Y A160240 Cf. A046994, A046995, A145156, A145157. %K A160240 nonn %O A160240 1,2 %A A160240 _Nathaniel Johnston_, May 05 2009 %E A160240 a(11) onwards from _Andrew Howroyd_, Nov 07 2015