OFFSET
1,1
COMMENTS
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
EXAMPLE
45 = 3*3*5 is included as there are more prime factors of the form 4k+3 (here two 3's) than prime factors of the form 4k+1 (here just one 5).
MATHEMATICA
Position[Array[Map[Length, {Select[#, Mod[#, 4] == 1 &], Select[#, Mod[#, 4] == 3 &]}] &@ Flatten@ Apply[Table[#1, {#2}] &, FactorInteger@ #, 1] &, {141}], {a_, b_} /; a < b] // Flatten (* Michael De Vlieger, Feb 05 2016 *)
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(PARI) isok(n) = {my(f = factor(n)); sum(k=1, #f~, ((f[k, 1] % 4)==1)*f[k, 2]) < sum(k=1, #f~, ((f[k, 1] % 4)==3)*f[k, 2]); } \\ Michel Marcus, Feb 05 2016
CROSSREFS
Complement: A268381.
KEYWORD
nonn
AUTHOR
Antti Karttunen, Feb 05 2016
STATUS
approved