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 A210660 #18 Oct 20 2014 17:15:14 %S A210660 1,2,6,7,14,23,86,179,538,1439,9566,21383,122847,777419,1965374, %T A210660 6803099,19860614,26489579,269998838,477028439 %N A210660 Smallest number m such that A210659(m)=n. %C A210660 The sequence was discovered by _Martins Opmanis_. %H A210660 J. Iraids, K. Balodis, J. Cernenoks, M. Opmanis, R. Opmanis and K. Podnieks, <a href="http://arxiv.org/abs/1203.6462">Integer Complexity: Experimental and Analytical Results</a>. arXiv preprint arXiv:1203.6462, 2012. - From _N. J. A. Sloane_, Sep 22 2012 %H A210660 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a> %Y A210660 Cf. A210659, A005245, A005520. %K A210660 nonn %O A210660 0,2 %A A210660 _Janis Iraids_, Mar 28 2012