262279

Appears in sequences

• Integers n such that 2^n == 11 (mod n).at n=2A033982
• Least inverse of A015910: smallest integer k > 0 such that 2^k mod k = n, or 0 if no such k exists.at n=11A036236
• Least positive number k such that 2^k mod k = 2n+1, or 0 if no such k exists.at n=5A124977
• Number of permutations of 1..n+4 with the number moved left exceeding the number moved right by n or more.at n=13A179579