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 A131012 #8 Jul 06 2018 08:06:18 %S A131012 0,0,0,0,0,-2,-3,-3,1,-72,3303,10788,287767,-2441508,41165366097, %T A131012 1073195273432754,155912367904160034530,3136560083478359027185613587, %U A131012 539970867097445764756784886568605205005,-6513790584274345956893756600832505179138091590508595552 %N A131012 a(n) = A121295(n) - A121265(n). %C A131012 We conjecture that from some point on, all terms are >= 0. %D A131012 David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing, in "The Mathematics of Preference, Choice and Order: Essays in Honor of Peter Fishburn", edited by Steven Brams, William V. Gehrlein and Fred S. Roberts, Springer, 2009, pp. 393-402. %H A131012 David Applegate, Marc LeBrun and N. J. A. Sloane, <a href="https://arxiv.org/abs/math/0611293">Descending Dungeons and Iterated Base-Changing</a>, arXiv:math/0611293 [math.NT], 2006-2007. %H A131012 David Applegate, Marc LeBrun, N. J. A. Sloane, <a href="https://www.jstor.org/stable/40391135">Descending Dungeons, Problem 11286</a>, Amer. Math. Monthly, 116 (2009) 466-467. %K A131012 sign %O A131012 0,6 %A A131012 _N. J. A. Sloane_, Sep 24 2007