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 A238107 #9 Aug 04 2025 12:37:09 %S A238107 1,10,107,1097,9754,72305,448536,2243671,8631118,24044702,44617008, %T A238107 48280086,24000420,3080792 %N A238107 5!*a(n) = number of self-avoiding paths in the 5-cube from 00000 to 11111 and having length 5 + 2*n. %C A238107 5!*a(n) counts paths with n back-steps. %H A238107 J. Berestycki, É. Brunet, Z. Shi, <a href="http://arxiv.org/abs/1401.6894">Accessibility percolation with backsteps</a>, arXiv preprint arXiv:1401.6894, 2014. %Y A238107 Cf. A059783, A238108. %K A238107 nonn,more %O A238107 0,2 %A A238107 _N. J. A. Sloane_, Mar 01 2014