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 A266242 #9 Dec 25 2015 21:06:44 %S A266242 0,36,43,50,57,64,71,78,85,92,99,106,149,156,163,170,177,184,191,198, %T A266242 205,212,219,262,269,276,283,290,297,304,311,318,325,332,375,382,389, %U A266242 396,403,410,417,424,431,438,445,488,495,502,509,516,523,530,537 %N A266242 Numbers n such that the initial digit of the fractional part of n*Pi is 0. %C A266242 Because 22/7 is so close to Pi, a(n+1) - a(n) is very often 7. %C A266242 n for which A145951(n) = 0. %H A266242 Robert Israel, <a href="/A266242/b266242.txt">Table of n, a(n) for n = 1..10000</a> %e A266242 36*Pi = 113.09... so 36 is in the sequence. %p A266242 select(t -> floor(10*t*Pi) mod 10 = 0, [$0..1000]); %o A266242 (PARI) for(n=0, 1e3, if(floor(10*n*Pi) % 10 == 0, print1(n", "))); \\ _Altug Alkan_, Dec 25 2015 %Y A266242 Cf. A145951. %K A266242 nonn,base %O A266242 1,2 %A A266242 _Robert Israel_, Dec 25 2015