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 A045366 #20 Sep 08 2022 08:44:55
%S A045366 2,5,13,29,37,53,61,101,109,149,157,173,181,197,229,269,277,293,317,
%T A045366 349,373,389,397,421,461,509,541,557,613,653,661,677,701,709,733,757,
%U A045366 773,797,821,829,853,877,941,997
%N A045366 Primes congruent to {2, 5} mod 8.
%H A045366 Ray Chandler, <a href="/A045366/b045366.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Vincenzo Librandi)
%H A045366 H. Quan, F. Roman, M. Washington, <a href="http://www.msri.org/system/cms/files/81/files/original/Research_Reports_2014_MSRI-UP_(Single_File).pdf">Infinite products and periodic sequences</a>, in MSRI-UP Research Reports, 2014, pp. 60-91.
%t A045366 Select[Prime[Range[300]],MemberQ[{2,5},Mod[#,8]]&] (* _Vincenzo Librandi_, Aug 10 2012 *)
%o A045366 (Magma) [p: p in PrimesUpTo(1200) | p mod 8 in [2, 5]]; // _Vincenzo Librandi_, Aug 10 2012
%Y A045366 Essentially the same as A007521.
%Y A045366 Cf. A000040, A045368.
%K A045366 nonn,easy
%O A045366 1,1
%A A045366 _N. J. A. Sloane_