|
%I #7 Mar 16 2019 21:45:47
%S 0,0,1,0,1,2,1,0,1,1,1,2,1,2,3,0,1,3,1,1,3,1,1,2,1,1,1,2,1,4,1,0,3,1,
%T 3,3,1,2,2,1,1,6,1,1,3,1,1,2,1,2,2,1,1,4,3,2,2,2,1,4,1,1,3,0,3,4,1,1,
%U 3,5,1,3,1,1,4,2,3,3,1,1,1,1,1,6,2,1,2,1,1,6,3,1,3,1,2,2,1,2,3,2,1,4,1,1,6
%N Number of divisors d of n such that A323243(d) is either 2 or 3 (mod 4).
%H Antti Karttunen, <a href="/A324827/b324827.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F a(n) = A000005(n) - A324826(n).
%F a(p) = 1 for all odd primes p.
%o (PARI) A324827(n) = sumdiv(n,d,((A323243(d)%4)>1));
%Y Cf. A000005, A324825, A324826, A324830, A324831, A324832.
%K nonn
%O 1,6
%A _Antti Karttunen_, Mar 16 2019
|
