Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Jul 12 2024 21:54:11
%S 1,2,4,8,15,16,30,32,35,39,45,51,55,60,64,70,75,78,87,90,91,95,102,
%T 110,111,115,117,119,120,123,128,135,140,143,150,153,155,156,159,174,
%U 175,180,182,183,187,190,203,204,215,219,220,222,225,230,234,235,238,240
%N Same numbers of distinct prime factors of forms 4*k+1 and 4*k+3.
%C Equivalently, numbers n such that A005089(n)=A005091(n); A005094(a(n))=0.
%C A001221(a(n)) and a(n) are of opposite parity.
%C If m is in the sequence, then also 2*m.
%C Conjecture : a(n) is asymptotic to c*n where c is around 4 - _Benoit Cloitre_, Jan 06 2003
%H Reinhard Zumkeller, <a href="/A078613/b078613.txt">Table of n, a(n) for n = 1..10000</a>
%e n = 99 = [(4*0+3)^2]*[(4*1+1)], therefore 99 is a term.
%t fQ[n_]:=Plus@@((Mod[#[[1]],4]-2)&/@If[n==1,{},FactorInteger[n]])==0; Select[Range[240],fQ] (* Ray Chandler, Dec 18 2011*)
%o (Haskell)
%o a078613 n = a078613_list !! (n-1)
%o a078613_list = filter ((== 0) . a005094) [1..]
%o -- _Reinhard Zumkeller_, Jan 07 2013
%Y Cf. A072202.
%Y Cf. A221264, A221265.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Dec 10 2002
%E Edited by _Ray Chandler_, Dec 18 2011