Number of primitive solutions to x + y + z = 0 (mod n).

Terms

a(0) =1a(1) =2a(2) =3a(3) =3a(4) =4a(5) =5a(6) =5a(7) =7a(8) =8a(9) =9a(10) =9a(11) =15a(12) =11a(13) =17a(14) =17a(15) =18a(16) =18a(17) =31a(18) =21a(19) =33a(20) =30a(21) =33a(22) =30a(23) =53a(24) =34a(25) =48a(26) =46a(27) =53a(28) =43a(29) =87