Least k > 0 such that the number of solutions to x^k == 1 (mod k) 1 <= x <= k is equal to n, or 0 if no such k exists.

A072995

Least k > 0 such that the number of solutions to x^k == 1 (mod k) 1 <= x <= k is equal to n, or 0 if no such k exists.

Terms

    a(0) =1a(1) =4a(2) =9a(3) =8a(4) =25a(5) =18a(6) =49a(7) =16a(8) =27a(9) =50a(10) =121a(11) =36a(12) =169a(13) =98a(14) =225a(15) =32a(16) =289a(17) =54a(18) =361a(19) =110a(20) =147a(21) =242a(22) =529a(23) =72a(24) =125a(25) =338a(26) =81a(27) =196a(28) =841a(29) =0

External references