4700063497

Appears in sequences

• Least inverse of A015910: smallest integer k > 0 such that 2^k mod k = n, or 0 if no such k exists.at n=3A036236
• Numbers k such that 2^k == 3 (mod k).at n=1A050259
• Least positive number k such that 2^k mod k = 2n+1, or 0 if no such k exists.at n=1A124977
• Least k such that n^k mod k = n + 1.at n=0A128172