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 A045390 #22 Sep 08 2022 08:44:56
%S A045390 2,17,41,73,89,97,113,137,193,233,241,257,281,313,337,353,401,409,433,
%T A045390 449,457,521,569,577,593,601,617,641,673,761,769,809,857,881,929,937,
%U A045390 953,977,1009,1033,1049,1097,1129
%N A045390 Primes congruent to {1, 2} mod 8.
%C A045390 Essentially the same as A007519: 2 followed by A007519.
%C A045390 Primes p such that -1 is a 4th power (mod p). E.g.: 1^4 == -1 (mod 2), 2^4 == -1 (mod 17), 3^4 == -1 (mod 41), 10^4 == -1 (mod 73). - _Eric M. Schmidt_, Mar 27 2014
%H A045390 Ray Chandler, <a href="/A045390/b045390.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Vincenzo Librandi)
%t A045390 Select[Prime[Range[300]],MemberQ[{1,2},Mod[#,8]]&] (* _Vincenzo Librandi_, Aug 11 2012 *)
%o A045390 (Magma) [p: p in PrimesUpTo(1300) | p mod 8 in [1, 2]]; // _Vincenzo Librandi_, Aug 11 2012
%Y A045390 Cf. A000040.
%K A045390 nonn,easy
%O A045390 1,1
%A A045390 _N. J. A. Sloane_