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 A035935 #17 Jan 03 2016 15:30:30 %S A035935 0,1,11,26,39,77,666 %N A035935 Smallest number that always takes at least n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k". %C A035935 Next term is at least 3*10^7. 666 may be the last term. - _Naohiro Nomoto_, Apr 07 2001 %C A035935 Checked up to 1.55*10^10. No other numbers apart 666 with minimal path of length 6. The largest number found with minimal path equal to 5 is 711111. - _Giovanni Resta_, Oct 03 2012 %Y A035935 Cf. A035930-A035934. %K A035935 nonn,base,nice %O A035935 0,3 %A A035935 _Erich Friedman_