|
%I #22 Oct 20 2017 18:50:32
%S 0,1,1,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,1,0,1,0,0,0,1,0,1,0,1,1,1,0,
%T 1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,0,
%U 1,0,1,1,1,0,1,0,1,0,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,1,1,0,1,0,1
%N Parity of sum of divisors of n less than n.
%C Partial sums up to n is about n/2. - _David A. Corneth_, Oct 20 2017
%H Antti Karttunen, <a href="/A053867/b053867.txt">Table of n, a(n) for n = 1..16384</a>
%H <a href="/index/Ch#char_fns">Index entries for characteristic functions</a>
%H <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>
%F a(n) = A001065(n) mod 2.
%F a(2n+1) = 1 - A010052(2n+1); a(4n + 2) = 1 - a(2n + 1); a(4n) = a(2n). - _David A. Corneth_, Oct 20 2017
%e a(9) = 0 because sum of proper divisors of 9 is 1 + 3 = 4 which is an even number.
%e From _David A. Corneth_, Oct 20 2017: (Start)
%e a(25) = 0 because 25 is an odd square. Therefore, a(2*25) = a(50) = 1 - a(25) = 1 and a(100) = a(2*50) = 1.
%e a(27) = 1 because 17 isn't an odd square. Therefore, a(2*27) = a(54) = 1-a(27) = 0 and a(108) = a(2*54) = 0. (End)
%o (PARI) A053867(n) = ((sigma(n)-n)%2); \\ _Antti Karttunen_, Oct 20 2017
%o (PARI) first(n) = my(res = vector(n, i, i%2)); forstep(i=1,sqrtint(n),2, for(j=0,logint(n\i^2,2), c = i^2 << j; res[c] = 1 - res[c])); res \\ _David A. Corneth_, Oct 20 2017
%Y Cf. A000005, A000265, A001065, A010052, A053866.
%K nonn,easy
%O 1,1
%A _Henry Bottomley_, Mar 29 2000
%E More terms from _James A. Sellers_, Apr 08 2000
|
