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 A191037 #21 Sep 08 2022 08:45:57
%S A191037 3,7,11,19,23,37,43,61,71,101,103,131,151,157,163,167,199,211,223,229,
%T A191037 233,239,241,251,257,269,281,293,307,313,317,331,353,379,383,389,401,
%U A191037 421,431,439,443,457,461,463,467,487,491,521,541,563,593,619,631,647
%N A191037 Primes p that have Jacobi symbol (p|58) = 1.
%C A191037 Originally incorrectly named "Primes which are squares mod 58", which is sequence A038901. - _M. F. Hasler_, Jan 15 2016
%H A191037 Vincenzo Librandi, <a href="/A191037/b191037.txt">Table of n, a(n) for n = 1..1000</a>
%p A191037 select(t -> isprime(t) and numtheory:-jacobi(t,58)=1, [seq(i,i=3..1000,2)]); # _Robert Israel_, Jan 15 2016
%t A191037 Select[Prime[Range[200]], JacobiSymbol[#,58]==1&]
%o A191037 (Magma) [p: p in PrimesUpTo(647) | KroneckerSymbol(p, 58) eq 1]; // _Vincenzo Librandi_, Sep 11 2012
%o A191037 (PARI) select(p->kronecker(p,58)==1&&isprime(p),[1..1000]) \\ This is to provide a generic characteristic function ("is_A191037") as 1st arg of select(), there are other ways to produce the sequence more efficiently. - _M. F. Hasler_, Jan 15 2016
%Y A191037 Cf. A191017, A191018, A191020, A191023, A191025, A191026, A191028, A191029, A191032, A191034, A191036.
%K A191037 nonn,easy
%O A191037 1,1
%A A191037 _T. D. Noe_, May 25 2011
%E A191037 Definition corrected (following an observation by _David Broadhurst_) by _M. F. Hasler_, Jan 15 2016