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 A153675 #5 Oct 18 2014 06:26:33 %S A153675 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, %T A153675 1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,4,4,4,5,6,6,7,9,11,13,19, %U A153675 30,76,81,238,913,1334,4645,6812,17396,351085,552184 %N A153675 Greatest number m such that the fractional part of (101/100)^A153671(m) >= 1-(1/m). %F A153675 a(n):=floor(1/(1-fract((101/100)^A153671(n)))), where fract(x) = x-floor(x). %e A153675 a(5)=1, since 1-(1/2)=0.5>fract((101/100)^A153671(5))=fract((101/100)^5)=0.0510...>=1-(1/1). %Y A153675 Cf. A153663, A154130, A153667, A153683, A153691, A153699, A153707, A153715, A153723. %K A153675 nonn %O A153675 1,41 %A A153675 _Hieronymus Fischer_, Jan 06 2009