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 A293859 #23 Feb 26 2019 05:05:02
%S A293859 2,5,7,11,13,19,23,37,41,47,53,59,89,103,127,131,139,157,167,173,179,
%T A293859 197,211,223,241,251,263,277,281,293,317,331,367,373,379,383,397,401,
%U A293859 409,419,449,463,487,491,499,503,521,557,569,571,601,607,613,619,641
%N A293859 Prime factors of numbers of the form k^2 + 10.
%C A293859 Primes p such that Legendre(-10,p) = 0 or 1. - _N. J. A. Sloane_, Dec 26 2017
%C A293859 Question: Is there a comment of the form "a prime number is in this sequence if and only if it is congruent to (list of appropriate values) mod n" for this sequence?
%C A293859 From _Robert Israel_, Nov 19 2017: (Start)
%C A293859 Prime p > 5 is in the sequence iff -10 is a quadratic residue mod p.
%C A293859 Thus p is either in the intersection of A002144 and A038879 or in neither of them.
%C A293859 Primes == 1, 2, 5, 7, 9, 11, 13, 19, 23, or 37 (mod 40). (End)
%H A293859 Robert Israel, <a href="/A293859/b293859.txt">Table of n, a(n) for n = 1..10000</a>
%e A293859 7 is in the sequence because 2^2 + 10 = 14 is 2 times 7.
%e A293859 19 is in the sequence because 3^2 + 10 = 19.
%p A293859 select(isprime, [seq(seq(i*40+j, j = [1, 2, 5, 7, 9, 11, 13, 19, 23, 37]), i=0..40)]); # _Robert Israel_, Nov 19 2017
%p A293859 # Load the Maple program HH given in A296920. Then run HH(-10, 200); This produces A155488, A296925, A293859. - _N. J. A. Sloane_, Dec 26 2017
%t A293859 Select[Prime@ Range@ 120, {} != FindInstance[# x == n^2 + 10 && n >= 0 && x > 0, {n, x}, Integers, 1] &] (* _Giovanni Resta_, Oct 19 2017 *)
%Y A293859 Cf. A002144, A038879, A114948.
%K A293859 nonn
%O A293859 1,1
%A A293859 _J. Lowell_, Oct 17 2017
%E A293859 More terms from _Giovanni Resta_, Oct 19 2017