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 A181584 #13 Jul 22 2025 08:42:02 %S A181584 5,226,255088,6663430912,3916162476483538,51249820944023435573470, %T A181584 14870957102232406137455708164254, %U A181584 95494789899510664733921727510895952184006 %N A181584 Number of cycles of length (2n+1)^2-1 on 2n+1 X 2n+1 square grid. %C A181584 This sequence is a way to extend the sequence A003763 in case of grids with odd number of nodes: a(n) is the number of cycles in odd-side square lattice with maximum possible length. %H A181584 Artem M. Karavaev, <a href="/A181584/b181584.txt">Table of n, a(n) for n=1..10</a> %H A181584 a(1)-a(10) were obtained during a small <a href="http://zealint.ru/prehamilton-cycles-lattice-results.html">programming contest</a> (in Russian). %H A181584 Artem M. Karavaev, <a href="https://web.archive.org/web/20161015202655/http://flowproblem.ru/cycles/prehamilton-cycles">Prehamilton Cycles page</a> %H A181584 <a href="/index/Gra#graphs">Index entries for sequences related to graphs, Hamiltonian</a> %Y A181584 Cf. A003763. %K A181584 nonn %O A181584 1,1 %A A181584 _Artem M. Karavaev_, Oct 31 2010