cp's OEIS Frontend

A243997 a(n) = phi(sigma(n) - phi(n) - d(n)), where phi(n) is the Euler totient function, sigma(n) the sum of divisors of n and d(n) the number of divisors of n.

%I A243997 #5 Jul 12 2014 17:50:46
%S A243997 1,0,0,1,0,2,0,6,2,4,0,6,0,6,4,6,0,18,0,12,8,10,0,20,4,12,6,18,0,24,0,
%T A243997 40,8,16,8,24,0,18,12,20,0,36,0,28,16,22,0,42,4,66,12,32,0,46,12,40,
%U A243997 16,28,0,48,0,30,30,40,16,56,0,40,16,48,0,104,0,36
%N A243997 a(n) = phi(sigma(n) - phi(n) - d(n)), where phi(n) is the Euler totient function, sigma(n) the sum of divisors of n and d(n) the number of divisors of n.
%C A243997 Subset of A243995.
%C A243997 a(p)=0 if p is prime.
%H A243997 Paolo P. Lava, <a href="/A243997/b243997.txt">Table of n, a(n) for n = 1..1000</a>
%e A243997 sigma(72) = 195, phi(72) = 24, d(72) = 12 and phi(195 - 24 - 12) = 104.
%p A243997 with(numtheory): P:=proc(q) local n;
%p A243997 for n from 1 to q do print(phi(sigma(n)-phi(n)-tau(n)));
%p A243997 od; end: P(100);
%Y A243997 Cf. A000005, A000010, A000203, A243995.
%K A243997 nonn,easy
%O A243997 1,6
%A A243997 _Paolo P. Lava_, Jun 19 2014