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