2228071

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=9A036236
• Integers n such that 2^n == 9 (mod n).at n=2A051447
• Least positive number k such that 2^k mod k = 2n+1, or 0 if no such k exists.at n=4A124977