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 A062459 #23 Dec 15 2017 17:35:10
%S A062459 2,3,37,101,197,677,5477,8837,17957,21317,42437,44101,98597,106277,
%T A062459 148997,217157,324901,401957,454277,476101,509797,828101,864901,
%U A062459 933157,1196837,1378277,1664101,1674437,1705637,1833317,1865957,1988101
%N A062459 Primes of form n^2 + mu(n), where mu is A008683.
%C A062459 All terms except for 3 are of the form n^2 + 1 where mu(n) = 1, since n^2 or n^2-1 can't be prime except for n=2. - _Robert Israel_, Oct 09 2015
%H A062459 Harry J. Smith, <a href="/A062459/b062459.txt">Table of n, a(n) for n = 1..1000</a>
%p A062459 R:= select(t -> numtheory:-mobius(t)=1, [$3..10000]):
%p A062459 2,3,op(select(isprime, map(t-> t^2+1, R))); # _Robert Israel_, Oct 09 2015
%t A062459 Select[Table[m^2+MoebiusMu[m],{m,0,1500}],PrimeQ] (* _Harvey P. Dale_, Feb 08 2011 *)
%o A062459 (PARI) j=[]; for(n=1,3000,x=n^2+moebius(n); if(isprime(x),j=concat(j,x))); j
%o A062459 (PARI) n=0; for (m=1, 10^5, x=m^2 + moebius(m); if (isprime(x), write("b062459.txt", n++, " ", x); if (n==1000, break))) \\ _Harry J. Smith_, Aug 08 2009
%o A062459 (PARI) list(lim)=my(v=List([2]),t); forstep(n=2,sqrtint(lim\1),4, if(isprime(t=n^2+moebius(n)), listput(v,t))); Vec(v) \\ _Charles R Greathouse IV_, Sep 22 2015
%Y A062459 Cf. A008683, A002496, A030229.
%K A062459 nonn
%O A062459 1,1
%A A062459 _Jason Earls_, Jul 26 2001