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 A160753 #5 Jul 19 2015 12:31:00 %S A160753 0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,1,0,0,1,1,1,0,1,1,1,0,0,0,0,1,1, %T A160753 1,1,1,0,1,0 %N A160753 Binary expansion of the Chaitin halting probability Omega_L for a certain programming language L. %C A160753 If this sequence were extended to 5000 terms, it would settle the Riemann hypothesis. %D A160753 C. S. Calude, E. Calude and M. J. Dinneen, A new measure of the difficulty of problems, J. Mult.-Valued Logic Soft. Comput., 12 (2006), 285-307. %D A160753 C. S. Calude and M. J. Dinneen, Exact approximations of omega numbers, Internat. J. Bifur. Chaos, 17 (6) (2007), 1937-1954. %H A160753 C. S. Calude, E. Calude and M. J. Dinneen, <a href="http://hdl.handle.net/2292/3784">A new measure of the difficulty of problems</a>, CDMTCS Research Reports CDMTCS-277 (2006). %H A160753 C. S. Calude and G. J. Chaitin, <a href="http://www.ams.org/notices/201002/rtx100200236p.pdf">What is ... a Halting Probability?</a>, Notices Amer. Math. Soc., 57 (No. 2, 2010), 236-237. %H A160753 C. S. Calude and M. J. Dinneen, <a href="http://hdl.handle.net/2292/3800">Exact approximations of omega numbers</a>, CDMTCS Research Reports CDMTCS-293 (2006). %Y A160753 Cf. A079365. %K A160753 nonn,hard,more %O A160753 0,1 %A A160753 _N. J. A. Sloane_, Jan 29 2010