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 A329095 #13 Aug 22 2020 17:43:20
%S A329095 3,5,9,11,13,15,19,21,25,27,29,33,35,37,39,43,45,51,53,55,57,59,61,63,
%T A329095 65,67,69,75,77,81,83,85,87,91,93,95,99,101,105,107,109,111,115,117,
%U A329095 121,123,125,129,131,133,135,139,141,143,145,147,149,153,155,157,159,163
%N A329095 Odd numbers k such that x^2 == 2 (mod k) has no solution.
%C A329095 Complement of A058529 over the odd numbers: odd numbers k such that x^2 == 2 (mod k) has solutions.
%C A329095 Odd numbers k such that at least one prime factor of k is congruent to 3 or 5 modulo 8 (at least one prime factor is in A003629).
%C A329095 Also odd terms in A025020.
%H A329095 Robert Israel, <a href="/A329095/b329095.txt">Table of n, a(n) for n = 1..10000</a>
%e A329095 x^2 == 2 (mod 45) has no solution, so 45 is a term.
%p A329095 filter:= proc(t) (numtheory:-factorset(t) mod 8) intersect {3,5} <> {} end proc:
%p A329095 select(filter, [seq(i,i=1..1000,2)]); # _Robert Israel_, Nov 05 2019
%t A329095 Reap[Do[If[AnyTrue[FactorInteger[k][[All, 1]], MatchQ[Mod[#, 8], 3|5]&], Sow[k]], {k, 1, 999, 2}]][[2, 1]] (* _Jean-François Alcover_, Aug 22 2020 *)
%o A329095 (PARI) isA329095(k) = (k%2) && !issquare(Mod(2,k))
%Y A329095 Cf. A003629. A047621 is a subsequence.
%Y A329095 Cf. A058529, A057126, A025020 (numbers k such that x^2 == 2 (mod k) has no solution).
%K A329095 nonn,easy
%O A329095 1,1
%A A329095 _Jianing Song_, Nov 04 2019