%I A065339
%S A065339 0,0,1,0,0,1,1,0,2,0,1,1,0,1,1,0,0,2,1,0,2,1,1,1,0,0,3,1,0,1,1,0,2,0,1,
%T A065339 2,0,1,1,0,0,2,1,1,2,1,1,1,2,0,1,0,0,3,1,1,2,0,1,1,0,1,3,0,0,2,1,0,2,1,
%U A065339 1,2,0,0,1,1,2,1,1,0,4,0,1,2,0,1,1,1,0,2,1,1,2,1,1,1,0,2,3,0,0,1,1,0,2
%N A065339 Number of primes congruent to 3 modulo 4 dividing n (with multiplicity).
%C A065339 (2^A007814(n)) * (3^a(n)) = A065338(n).
%H A065339 T. D. Noe, <a href="b065339.txt">Table of n, a(n) for n=1..10000</a>
%Y A065339 Cf. A065338, A005091, A007949, A083025.
%Y A065339 Sequence in context: A091586 A116377 A131964 this_sequence A122434 A141571 
               A164067
%Y A065339 Adjacent sequences: A065336 A065337 A065338 this_sequence A065340 A065341 
               A065342
%K A065339 nonn
%O A065339 1,9
%A A065339 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 29 2001