|
%I #14 Jun 26 2018 04:58:41
%S -1,0,0,0,0,6,0,1,1,10,0,10,0,14,12,4,0,18,0,16,16,22,0,20,3,26,6,22,
%T 0,56,0,11,24,34,20,29,0,38,28,30,0,76,0,34,30,46,0,42,5,52,36,40,0,
%U 58,28,40,40,58,0,92,0,62,38,26,32,116,0,52,48,112,0,54,0,74,58,58,32,136,0,60,23,82,0,124,40,86,60,60,0,144,36,70,64
%N a(n) = usigma(n) - (phi(n) + d(n)), where usigma(n) is the sum of the unitary divisors of n and d(n) is the number of divisors of n.
%H Harry J. Smith, <a href="/A063085/b063085.txt">Table of n, a(n) for n = 1..1000</a>
%o (PARI) a(n)={sumdiv(n, d, if(gcd(d, n/d)==1, d)) - eulerphi(n) - numdiv(n)}
%Y Cf. A034448.
%K easy,sign
%O 1,6
%A _Jason Earls_, Aug 06 2001
|
