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 A221265 #11 Jan 26 2022 11:58:01
%S A221265 5,10,13,17,20,25,26,29,34,37,40,41,50,52,53,58,61,65,68,73,74,80,82,
%T A221265 85,89,97,100,101,104,106,109,113,116,122,125,130,136,137,145,146,148,
%U A221265 149,157,160,164,169,170,173,178,181,185,193,194,195,197,200,202
%N A221265 Numbers having more distinct prime factors of form 4*k+1 than of 4*k+3.
%C A221265 A005089(a(n)) > A005091(a(n)); A005094(a(n)) > 0.
%H A221265 Reinhard Zumkeller, <a href="/A221265/b221265.txt">Table of n, a(n) for n = 1..10000</a>
%t A221265 mdpf1Q[n_]:=Module[{f=Transpose[FactorInteger[n]][[1]]},Count[f,_?(Mod[ #,4] == 1&)]>Count[f,_?(Mod[#,4]==3&)]]; Select[Range[2,250],mdpf1Q] (* _Harvey P. Dale_, Mar 03 2016 *)
%o A221265 (Haskell)
%o A221265 a221265 n = a221265_list !! (n-1)
%o A221265 a221265_list = filter ((> 0) . a005094) [1..]
%Y A221265 Cf. A078613, A221264.
%Y A221265 Cf. A005089, A005091, A005094.
%K A221265 nonn
%O A221265 1,1
%A A221265 _Reinhard Zumkeller_, Jan 07 2013