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 A153670 #15 Dec 24 2021 08:17:02 %S A153670 1,2,3,4,5,6,7,8,9,70,209,241,378,2697,4806,173389,529938,1334508, %T A153670 1572706,7840546,15896994,20204295,71074288,119325567 %N A153670 Numbers k such that the fractional part of (101/100)^k is less than 1/k. %C A153670 Numbers k such that fract((101/100)^k) < 1/k, where fract(x) = x-floor(x). %C A153670 The next term is greater than 2*10^8. %e A153670 a(10) = 70 since fract((101/100)^70) = 0.006... < 1/10, but fract((101/100)^k) > 0.1 >= 1/k for 10 <= k <= 69. %t A153670 Select[Range[1000], FractionalPart[(101/100)^#] < (1/#) &] (* _G. C. Greubel_, Aug 24 2016 *) %o A153670 (Python) %o A153670 from itertools import count, islice %o A153670 def A153670gen(): # generator of terms %o A153670 k10, k11 = 100, 101 %o A153670 for k in count(1): %o A153670 if (k11 % k10)*k < k10: %o A153670 yield k %o A153670 k10 *= 100 %o A153670 k11 *= 101 %o A153670 A153670_list = list(islice(A153670gen(),16)) # _Chai Wah Wu_, Dec 23 2021 %Y A153670 Cf. A153662, A154130, A153674, A153678, A153686, A153694, A153702, A153710, A153718. %K A153670 nonn,more %O A153670 1,2 %A A153670 _Hieronymus Fischer_, Jan 06 2009 %E A153670 a(18)-a(24) from _Robert Gerbicz_, Nov 29 2010