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 A139843 #19 Sep 08 2022 08:45:33
%S A139843 17,23,41,71,113,167,233,311,401,431,449,479,503,521,617,641,719,743,
%T A139843 809,839,857,881,887,911,929,983,1031,1049,1151,1193,1217,1289,1319,
%U A139843 1367,1433,1439,1553,1559,1601,1697,1847,2063,2081,2111,2153,2207
%N A139843 Primes of the form 6x^2 + 17y^2.
%C A139843 Discriminant = -408. See A139827 for more information.
%H A139843 Vincenzo Librandi and Ray Chandler, <a href="/A139843/b139843.txt">Table of n, a(n) for n = 1..10000</a> [First 1000 terms from Vincenzo Librandi]
%H A139843 N. J. A. Sloane et al., <a href="https://oeis.org/wiki/Binary_Quadratic_Forms_and_OEIS">Binary Quadratic Forms and OEIS</a> (Index to related sequences, programs, references)
%F A139843 The primes are congruent to {17, 23, 41, 65, 71, 95, 113, 143, 167, 209, 215, 233, 311, 329, 335, 377, 401} (mod 408).
%t A139843 QuadPrimes2[6, 0, 17, 10000] (* see A106856 *)
%o A139843 (Magma) [ p: p in PrimesUpTo(3000) | p mod 408 in {17, 23, 41, 65, 71, 95, 113, 143, 167, 209, 215, 233, 311, 329, 335, 377, 401}]; // _Vincenzo Librandi_, Jul 29 2012
%o A139843 (PARI) list(lim)=my(v=List([17]), s=[23, 41, 65, 71, 95, 113, 143, 167, 209, 215, 233, 311, 329, 335, 377, 401]); forprime(p=23, lim, if(setsearch(s, p%408), listput(v, p))); Vec(v) \\ _Charles R Greathouse IV_, Feb 10 2017
%K A139843 nonn,easy
%O A139843 1,1
%A A139843 _T. D. Noe_, May 02 2008