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 A185377 #20 Feb 15 2020 23:22:15
%S A185377 697,1241,1513,1649,1921,2329,2993,3281,3649,3961,3977,4097,4369,4633,
%T A185377 4777,5321,5617,5729,6001,6497,6817,6953,7081,7361,7633,7769,7913,
%U A185377 8249,8633,8857,9553,9673,9809,9881,10001,10057,10081,10217,10489,10537
%N A185377 Product of exactly two distinct primes congruent to 1 mod 8 (A007519).
%C A185377 Subset of semiprimes A001358. Subset of {d = p_1 * p_2 * ... * p_m where p_i == 1 (mod 8), 1 <= i <= m are distinct primes} as occurs in Wei, p. 2.
%H A185377 Vincenzo Librandi, <a href="/A185377/b185377.txt">Table of n, a(n) for n = 1..1000</a>
%H A185377 Dasheng Wei, <a href="http://arxiv.org/abs/1102.3811">On the equation x^2-Dy^2=n</a>, Feb 18, 2011.
%F A185377 {A007519(i) * A007519(j) for i < j}.
%F A185377 {A000040(i) * A000040(j) for i < j, and A000040(i) in A017077 and A000040(j) in A017077}.
%e A185377 10001 is in this sequence because 10001 = 73 * 137 = A007519(3) * A007519(7).
%t A185377 p = Select[Prime[Range[200]], Mod[#, 8] == 1 &]; Sort[Reap[Do[n=p[[i]] p[[j]]; If[n <= p[[1]]p[[-1]], Sow[n]], {i, 2, Length[p]}, {j, i - 1}]][[2,1]]]
%o A185377 (PARI) list(lim)=my(v=List(),P=List(),t); forprime(p=2,lim\17, if(p%8==1, listput(P,p))); for(i=2,#P, my(p=P[i]); for(j=1,i-1, t=p*P[j]; if(t>lim, break); listput(v,t))); Set(v) \\ _Charles R Greathouse IV_, Jul 03 2016
%Y A185377 Cf. A000040, A001358, A007519, A017077.
%K A185377 nonn,easy
%O A185377 1,1
%A A185377 _Jonathan Vos Post_, Feb 20 2011