a(n) is the smallest integer k, 0<k<n, that most often satisfies the condition: k^m > k^(m+1) (modulo n) as m varies from 1 to n-1, for n>2, with a(1)=0 and a(2)=1.

A089587

a(n) is the smallest integer k, 0<k<n, that most often satisfies the condition: k^m > k^(m+1) (modulo n) as m varies from 1 to n-1, for n>2, with a(1)=0 and a(2)=1.

Terms

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

External references