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 A080022 #9 Jun 24 2014 01:08:35
%S A080022 2,3,10,31,306,9488,9489,29808,29809,93648,294204,9122171,28658146,
%T A080022 888582403,8769956796,27551631843,86556004192,854273519914,
%U A080022 2683779414318,8431341691876,26487841119103,26487841119104
%N A080022 Numbers n such that log_pi(n) is closer to an integer than is log_pi(m) for any m with 2<=m<n.
%C A080022 Every term is floor(pi^k)+r for some integers k and r with k>=1 and -1 <= r <= 1.
%D A080022 Suggested by _Neil Fernandez_, Jan 19 2003
%e A080022 log_pi(2) = 1-0.394..., log_pi(3) = 1-0.0402..., log_pi(10) = 2+0.0114..., log_pi(31) = 3-0.000176...
%o A080022 (PARI) lista(nn) = {flmin = 1; for (i = 2, nn, li = log(i)/log(Pi); fli = abs(round(li) - li); if (fli < flmin, print1(i, ", "); flmin = fli;););} \\ _Michel Marcus_, Aug 29 2013
%Y A080022 Cf. A080021, A080023.
%K A080022 nonn
%O A080022 1,1
%A A080022 _Dean Hickerson_, Jan 20 2003