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 A202766 #31 Feb 16 2025 08:33:16
%S A202766 6,27,167,1206,9442,77563,658097,5714972,50503822,452425909,
%T A202766 4097411586,37441633014,344698955565,3193520274110,29747746198318,
%U A202766 278407464679282,2616351626277085,24676888631241563,233501199663256017,2215874110986269907
%N A202766 Floor( 10^n / sum(k=3..10^n, 1/k ) ).
%C A202766 n/(Sum_{k=3..n} 1/k) is a better approximation to pi(n) than Gauss' Li(n) for 15 < n < 2803.
%D A202766 Wacław Sierpiński, Co wiemy, a czego nie wiemy o liczbach pierwszych. Warsaw: PZWS, 1961, p. 21.
%H A202766 Arkadiusz Wesolowski, <a href="/A202766/b202766.txt">Table of n, a(n) for n = 1..200</a>
%H A202766 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeCountingFunction.html">Prime Counting Function</a>
%H A202766 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeNumberTheorem.html">Prime Number Theorem</a>
%F A202766 a(n) = floor((10^n)/(Sum_{k=3..10^n} 1/k)).
%F A202766 a(n) ~ 10^n/(log(10^n) + gamma - 3/2).
%e A202766 a(2) = 27 because (10^2)/(Sum_{k=3..100} 1/k) = 27.1195448585....
%t A202766 lst = {}; Do[AppendTo[lst, Floor[10^n/(NIntegrate[(1 - x^10^n)/(1 - x), {x, 0, 1}, WorkingPrecision -> 20] - 1.5)]], {n, 13}]; lst
%Y A202766 Cf. A000720, A006880, A193257.
%K A202766 nonn
%O A202766 1,1
%A A202766 _Arkadiusz Wesolowski_, Dec 23 2011