A293899 Number of proper divisors of the form 3k+1 minus number of proper divisors of the form 3k+2.
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, -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, 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
Offset: 1
Links
- Antti Karttunen, Table of n, a(n) for n = 1..20000
Programs
-
Mathematica
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 *) Table[Total[Which[Mod[#,3]==1,1,Mod[#,3]==2,-1,True,0]&/@Most[ Divisors[ n]]],{n,110}] (* Harvey P. Dale, Nov 26 2021 *)
-
PARI
A293895(n) = sumdiv(n,d,(d
A293896(n) = sumdiv(n,d,(d A293899(n) = (A293895(n) - A293896(n));