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 A052434 #30 Feb 16 2025 08:32:42
%S A052434 1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,-1,0,0,0,-1,0,0,0,0,1,0,0,-1,0,0,0,
%T A052434 0,1,0,0,0,1,0,0,-1,0,0,0,-1,0,0,0,0,0,0,0,0,0,1,1,0,0,-1,0,0,0,0,1,0,
%U A052434 0,0,0,0,0,-1,-1,-1,0,0,0,-1,0,0,0,-1,-1,0,0,0,0,-1,0,0,0,0,0,1,1,0,0,0,1,0
%N A052434 Nearest integer to R(n) - pi(n), where R(x) is the Riemann prime counting function.
%C A052434 The Riemann prime counting function R(n) = Sum_{prime powers p^k <= n} 1/k = A096624(n)/A096625(n). - _N. J. A. Sloane_, Feb 07 2023
%H A052434 Harry J. Smith, <a href="/A052434/b052434.txt">Table of n, a(n) for n = 2..10000</a>
%H A052434 H. J. Smith, <a href="http://harry-j-smith-memorial.com/download.html#XPCalc">XPCalc - Extra Precision Floating-Point Calculator</a> [Broken link]
%H A052434 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RiemannPrimeCountingFunction.html">Riemann Prime Counting Function</a>
%e A052434 a(13) = 0 because R(13) = 5.504 and pi(13) = 6.
%o A052434 (XPCalc) a=Round(Ri(n)-Pi(n)) - _Harry J. Smith_, Dec 31 2008
%Y A052434 Cf. A052435, A096624, A096625.
%K A052434 sign
%O A052434 2,108
%A A052434 _Eric W. Weisstein_
%E A052434 Corrected 6 terms, a(2), a(7), a(10), a(13), a(20) and a(48). Each was made 1 larger. Also gave an example for a(13) and a program for computing a(n). - _Harry J. Smith_, Dec 31 2008