a(n) is the smallest number k such that prime(k) == 2*n-1 (mod phi(k)).

A071169

a(n) is the smallest number k such that prime(k) == 2*n-1 (mod phi(k)).

Terms

    a(0) =3a(1) =5a(2) =7a(3) =15a(4) =22a(5) =17a(6) =19a(7) =48a(8) =23a(9) =41a(10) =82a(11) =39a(12) =29a(13) =47a(14) =77a(15) =94a(16) =53a(17) =91a(18) =112a(19) =69a(20) =81a(21) =61a(22) =59a(23) =101a(24) =189a(25) =142a(26) =103a(27) =85a(28) =107a(29) =109

External references