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 A059112 #12 Jul 07 2024 13:44:37
%S A059112 4,4,4,5,4,5,4,5,7,6,8,8,6,6,8,10,7,9,9,6,8,7,8,12,11,8,7,5,4,13,12,
%T A059112 13,10,15,12,12,13,12,13,13,10,15,11,10,7,13,20,18,15,13,14,10,14,15,
%U A059112 15,15,12,12,10,7,11,19,17,13,11,20,20,24,20,18,18,20,20,20,18,18,20,18
%N A059112 floor(prime(n) - n*log(n) - n*log(log(n)) + n).
%H A059112 C. K. Caldwell, <a href="http://www.utm.edu/research/primes/howmany.shtml">How Many Primes Are There?</a>
%e A059112 a(10000) = floor[104729 - 92103.403 - 22203.268 + 10000] = floor[422.328] = 422.
%t A059112 Table[Floor[Prime[n]-n Log[n]-n Log[Log[n]]+n],{n,2,80}] (* _Harvey P. Dale_, Jul 10 2023 *)
%o A059112 (PARI) vector(100,n,floor(prime(n+1) - (n+1)*log(n+1) - (n+1)*log(log(n+1))+n+1)) \\ _Derek Orr_, Oct 27 2014
%Y A059112 Cf. A000040, A059111.
%K A059112 nonn,easy
%O A059112 2,1
%A A059112 _Henry Bottomley_, Jan 04 2001