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 A265914 #23 Jul 23 2025 10:04:18 %S A265914 1,1,3,38,549,28728,1692417,377919174,93177169027,91255604983167, %T A265914 98333935794279062,431583106977641773651,2081500714709464758363648, %U A265914 41476136050841717002906372881,907951420995033325255530074961505,82829339673122474155192677008453291270 %N A265914 Number of Hamiltonian paths on an n X n grid reduced for symmetry, i.e., where rotations and reflections are not counted as distinct. %C A265914 For odd n > 1 the only symmetry possible is rotation by 180 degrees. For even n the only symmetries are reflections either horizontally or vertically. - _Andrew Howroyd_, Apr 15 2016 %H A265914 Oliver R. Bellwood, Heitor P. Casagrande, and William J. Munro, <a href="https://arxiv.org/abs/2507.11820">Fractal Path Strategies for Efficient 2D DMRG Simulations</a>, arXiv:2507.11820 [cond-mat.str-el], 2025. See p. 5. %H A265914 Jean-Marc Mayer, Claude Guez, and Jean Dayantis, <a href="http://dx.doi.org/10.1103/PhysRevB.42.660">Exact computer enumeration of the number of Hamiltonian paths in small square plane lattices</a>, Physical Review B, Vol. 42 Number 1, 1990. %Y A265914 Cf. A120443, A209077, A068393. %K A265914 nonn,walk,hard %O A265914 1,3 %A A265914 _Luca Petrone_, Dec 18 2015 %E A265914 a(9)-a(15) from _Andrew Howroyd_, Apr 15 2016 %E A265914 a(16) from _Oliver R. Bellwood_, Jun 06 2025