cp's OEIS Frontend

A293899 Number of proper divisors of the form 3k+1 minus number of proper divisors of the form 3k+2.

%I A293899 #20 Nov 25 2023 07:53:11
%S A293899 0,1,1,0,1,0,1,1,1,-1,1,1,1,1,0,0,1,0,1,1,2,-1,1,0,0,1,1,1,1,0,1,1,0,
%T A293899 -1,1,1,1,1,2,-1,1,0,1,1,0,-1,1,1,2,1,0,1,1,0,-1,1,2,-1,1,0,1,1,2,0,1,
%U A293899 0,1,1,0,-1,1,0,1,1,1,1,1,0,1,1,1,-1,1,2,-1,1,0,-1,1,0,3,1,2,-1,1,0,1,1,0,0,1,0,1,1,0
%N A293899 Number of proper divisors of the form 3k+1 minus number of proper divisors of the form 3k+2.
%H A293899 Antti Karttunen, <a href="/A293899/b293899.txt">Table of n, a(n) for n = 1..20000</a>
%F A293899 When n = 3k, a(n) = A002324(n), when n = 3k+1, a(n) = A002324(n) - 1, when n = 3k+2, a(n) = A002324(n) + 1.
%F A293899 a(n) = A002324(n) - A010872(n) (mod 3).
%F A293899 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/(3*sqrt(3)) = 0.604599... (A073010). - _Amiram Eldar_, Nov 25 2023
%t A293899 Table[DivisorSum[n, 1 &, And[Mod[#, 3] == 1, # != n] &] - DivisorSum[n, 1 &, And[Mod[#, 3] == 2, # != n] &], {n, 105}] (* _Michael De Vlieger_, Nov 08 2017 *)
%t A293899 Table[Total[Which[Mod[#,3]==1,1,Mod[#,3]==2,-1,True,0]&/@Most[ Divisors[ n]]],{n,110}] (* _Harvey P. Dale_, Nov 26 2021 *)
%o A293899 (PARI)
%o A293899 A293895(n) = sumdiv(n,d,(d<n)*(1==(d%3)));
%o A293899 A293896(n) = sumdiv(n,d,(d<n)*(2==(d%3)));
%o A293899 A293899(n) = (A293895(n) - A293896(n));
%Y A293899 Cf. A002324, A010872, A073010, A293895, A293896.
%K A293899 sign,easy
%O A293899 1,21
%A A293899 _Antti Karttunen_, Nov 06 2017