a(n) = floor(n/2) - gpf(phi(n)), where gpf(n) is the largest prime factor of n.
A070817
a(n) = floor(n/2) - gpf(phi(n)), where gpf(n) is the largest prime factor of n.
Terms
- a(0) =-1a(1) =0a(2) =0a(3) =1a(4) =0a(5) =2a(6) =1a(7) =3a(8) =0a(9) =4a(10) =3a(11) =4a(12) =5a(13) =6a(14) =6a(15) =6a(16) =6a(17) =8a(18) =7a(19) =6a(20) =0a(21) =10a(22) =7a(23) =10a(24) =10a(25) =11a(26) =7a(27) =13a(28) =10a(29) =14
External references
- oeis: A070817