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 A059783 #25 Jan 14 2024 12:37:00 %S A059783 1,2,18,6432,18651552840 %N A059783 Number of paths (without loops) in graph of n-dimensional hypercube starting at point (0,0,0,...,0) and ending at (1,1,1,...,1). %C A059783 Terms up to a(5)=18651552840 confirmed by independent computation. [_Joerg Arndt_, Aug 07 2012] %H A059783 J. Berestycki, É. Brunet, and Z. Shi, <a href="http://arxiv.org/abs/1401.6894">Accessibility percolation with backsteps</a>, arXiv preprint arXiv:1401.6894 [math.PR], 2014. %H A059783 Higher Dimensions <a href="http://teamikaria.com/hddb/forum/viewtopic.php?f=27&t=1211">Number of simple paths in a tesseract</a> [From _Dmitry Kamenetsky_, Aug 28 2009] %e A059783 a(2) = 2 because there are 2 paths: 00,01,11 and 00,10,11 %Y A059783 Cf. A007764. %Y A059783 Cf. A091299, A006069, A006070, A003042, A066037, A091302. %K A059783 nonn,hard,more %O A059783 1,2 %A A059783 Avi Peretz (njk(AT)netvision.net.il), Feb 22 2001 %E A059783 Added a(5), based on http://teamikaria.com/4dforum/viewtopic.php?f=5&t=1211 _Dmitry Kamenetsky_, Aug 28 2009 %E A059783 Corrected offset _Alex Ratushnyak_, Aug 07 2012