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 A153691 #2 Mar 31 2012 13:21:05 %S A153691 1,1,1,1,2,4,19,21,28,151,200,709,767,5727,15908,162819,302991 %N A153691 Greatest number m such that the fractional part of (11/10)^A153687(m) >= 1-(1/m). %F A153691 a(n):=floor(1/(1-fract((11/10)^A153687(n)))), where fract(x) = x-floor(x). %e A153691 a(6)=4, since 1-(1/5)=0.8>fract((11/10)^A153687(6))=fract((11/10)^6)=0.771...>=1-(1/4). %Y A153691 Cf. A153663, A153671, A153679, A153683, A154130, A153699, A153707, A153715, A153723. %K A153691 nonn,more %O A153691 1,5 %A A153691 _Hieronymus Fischer_, Jan 06 2009