Least inverse of A015910: smallest integer k > 0 such that 2^k mod k = n, or 0 if no such k exists.

Terms

a(0) =1a(1) =0a(2) =3a(3) =4700063497a(4) =6a(5) =19147a(6) =10669a(7) =25a(8) =9a(9) =2228071a(10) =18a(11) =262279a(12) =3763a(13) =95a(14) =1010a(15) =481a(16) =20a(17) =45a(18) =35a(19) =2873a(20) =2951a(21) =3175999a(22) =42a(23) =555a(24) =50a(25) =95921a(26) =27a(27) =174934013a(28) =36a(29) =777