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 A197186 #20 Dec 03 2018 12:57:52
%S A197186 2,17,31,41,53,101,109,127,139,179,397,419,547,787,997,1031,1229,1801,
%T A197186 1811,2099,2237,2417,2423,2657,3163,3203,3517,3581,3583,3931,4241,
%U A197186 5503,5507,5557,6079,8087,8719,10433,10487,13399,13411,19309,22303,22307,22613
%N A197186 The Riemann primes of the psi type and index 2.
%C A197186 The sequence consists of the prime numbers p that are champions (left to right maxima) of the function |psi(p^2)-p^2|, where psi(p) is the Chebyshev psi function.
%H A197186 Dana Jacobsen, <a href="/A197186/b197186.txt">Table of n, a(n) for n = 1..84</a>
%H A197186 M. Planat and P. Solé, <a href="http://arxiv.org/abs/1109.6489">Efficient prime counting and the Chebyshev primes</a>, arXiv:1109.6489 [math.NT], 2011.
%t A197186 ChebyshevPsi[n_] := Range[n] // MangoldtLambda // Total;
%t A197186 Reap[For[max=0; p=2, p < 2000, p = NextPrime[p], f = Abs[ChebyshevPsi[p^2] - p^2]; If[f > max, max = f; Print[p]; Sow[p]]]][[2, 1]] (* _Jean-François Alcover_, Dec 03 2018 *)
%o A197186 (Perl) use ntheory ":all"; my($max,$f)=(0); forprimes { $f=abs(chebyshev_psi($_**2)-$_**2); if ($f > $max) { say; $max=$f; } } 10000; # _Dana Jacobsen_, Dec 29 2015
%Y A197186 Cf. A196668, A197185, A197187, A197188.
%K A197186 nonn
%O A197186 1,1
%A A197186 _Michel Planat_, Oct 11 2011
%E A197186 More terms from _Dana Jacobsen_, Dec 29 2015