a(n) = phi(n) mod PrimePi(n).

A073464

a(n) = phi(n) mod PrimePi(n).

Terms

    a(0) =0a(1) =0a(2) =0a(3) =1a(4) =2a(5) =2a(6) =0a(7) =2a(8) =0a(9) =0a(10) =4a(11) =0a(12) =0a(13) =2a(14) =2a(15) =2a(16) =6a(17) =2a(18) =0a(19) =4a(20) =2a(21) =4a(22) =8a(23) =2a(24) =3a(25) =0a(26) =3a(27) =8a(28) =8a(29) =8

External references