a(n) = sum of order of a mod n, 0 < a < n, gcd(a, n) = 1.

Terms

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