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 A358696 #18 Nov 27 2022 10:49:30 %S A358696 1,5,36,191,1123,6410,37165,214515,1240200,7165033,41403125,239227616, %T A358696 1382302375,7987125379,46150853892,266666446637,1540838849619, %U A358696 8903196975232,51444004997119,297251155267189,1717561649837610,9924328164015589,57344252900906673,331343672343272500,1914553310297505893,11062575457823993391,63921216037276901284 %N A358696 Number of self-avoiding closed paths in the 5 X n grid graph which pass through all vertices on four (left, right, upper, lower) sides of the graph. %H A358696 Seiichi Manyama, <a href="/A358696/b358696.txt">Table of n, a(n) for n = 2..50</a> %F A358696 Conjecture: a(n) = 6 *a(n-1) + a(n-2) - 20 * a(n-3) + 37 * a(n-4) + 16 * a(n-5) - 12 * a(n-6) - 7 * a(n-7) + 5 * a(n-8) - a(n-9) for n > 10. %Y A358696 Row 5 of A333758. %Y A358696 Cf. A333515. %K A358696 nonn %O A358696 2,2 %A A358696 _Seiichi Manyama_, Nov 27 2022