|
%I #19 Nov 20 2023 15:27:16
%S 1,0,0,0,1,-1,2,0,2,0,5,-1,6,0,2,2,9,-1,10,0,4,2,13,-1,11,3,9,3,18,-2,
%T 19,5,9,5,13,1,24,6,12,4,27,-1,28,6,10,8,31,1,27,5,17,9,36,2,24,8,20,
%U 12,41,-1,42,12,18,14,30,2,47,13,25,5,50,4,51,15,19,15,39,3,56,10,32,18,59,1,41,19
%N a(n) = phi(n) - pi(n).
%C It is known that a(n) >= 0 for n >= 61.
%D D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, p. 11.
%H Alois P. Heinz, <a href="/A037228/b037228.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%t Table[EulerPhi[n]-PrimePi[n],{n,90}] (* _Harvey P. Dale_, Feb 02 2021 *)
%o (PARI) a(n) = eulerphi(n) - primepi(n); \\ _Michel Marcus_, Aug 08 2019
%Y Cf. A000010, A000720, A037171, A037229.
%K sign
%O 1,7
%A _N. J. A. Sloane_.
|
