OFFSET
1,1
COMMENTS
The sequence consists of the prime numbers p that are champions (left to right maxima) of the function |theta(p^2)-p^2|, where theta(p) is the Chebyshev theta function.
LINKS
Dana Jacobsen, Table of n, a(n) for n = 1..173
M. Planat and P. Solé, Efficient prime counting and the Chebyshev primes arXiv:1109.6489 [math.NT], 2011.
PROG
(Perl) use ntheory ":all"; my($max, $f)=(0); forprimes { $f=abs(chebyshev_theta($_**2)-$_**2); if ($f > $max) { say; $max=$f; } } 10000; # Dana Jacobsen, Dec 29 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Planat, Oct 13 2011
STATUS
approved