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 A038941 #11 Jul 08 2025 22:32:32 %S A038941 3,5,13,19,41,47,61,73,83,97,103,107,109,113,127,131,137,149,163,167, %T A038941 179,197,199,229,239,241,257,263,269,271,283,293,317,347,353,367,379, %U A038941 431,439,443,449,461,463,479,487 %N A038941 Primes p such that 61 is a square mod p. %C A038941 Also, primes p that are squares mod 61 (from the quadratic reciprocity law). - _Lekraj Beedassy_, Jul 13 2004 %H A038941 Vincenzo Librandi, <a href="/A038941/b038941.txt">Table of n, a(n) for n = 1..1000</a> %t A038941 Select[Prime[Range[100]], ! JacobiSymbol[61, #] == -1 &] (* _Vincenzo Librandi_, Sep 08 2012 *) %K A038941 nonn %O A038941 1,1 %A A038941 _N. J. A. Sloane_