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 A257362 #20 Feb 20 2021 00:47:32 %S A257362 41,43,47,53,61,71,83,97,113,131,151,163,167,173,179,197,199,223,227, %T A257362 251,263,281,307,313,347,359,367,373,379,383,397,409,419,421,439,457, %U A257362 461,487,499,503,523,547,563,577,593,607,641,647,653,661,673,677,691 %N A257362 Odd primes modulo which -163 is a square. %C A257362 Contains A005846. The first members that are not in A005846 are 163 and 167. %C A257362 Primes that divide some member of A202018. %C A257362 Primes congruent to x^2 mod 163 for some x, 0 <= x <= 162. %C A257362 Primes of the form x^2 + xy + 41y^2. Also, primes of the form x^2 - xy + 41y^2 with x and y nonnegative. - _Jianing Song_, Feb 19 2021 %H A257362 Robert Israel, <a href="/A257362/b257362.txt">Table of n, a(n) for n = 1..10000</a> %F A257362 a(n) ~ 2n log n. - _Charles R Greathouse IV_, Nov 28 2016 %p A257362 select(p -> isprime(p) and (p=163 or numtheory:-legendre(-163,p)=1), [seq(2*i+1,i=1..1000)]); %p A257362 # Another Maple program is given in A296920. - _N. J. A. Sloane_, Dec 25 2017 %t A257362 Reap[For[p=3, p<1000, p = NextPrime[p], If[p==163 || KroneckerSymbol[-163, p] == 1, Print[p]; Sow[p]]]][[2, 1]] (* _Jean-François Alcover_, Apr 29 2019 *) %o A257362 (PARI) is(n)=isprime(n) && issquare(Mod(-163,n)) \\ _Charles R Greathouse IV_, Nov 28 2016 %Y A257362 Cf. A005846, A202018. %K A257362 nonn,easy %O A257362 1,1 %A A257362 _Robert Israel_, Apr 20 2015