162193

Appears in sequences

• Brilliant Sarrus numbers.at n=16A086837
• Composite integers k such that 2^k == 2 (mod k*(k+1)).at n=24A217465
• Numbers k > 1 such that 2^k == 2 (mod k) and gcd(k, 3^k - 3) = 1.at n=5A300762
• Numbers k such that 2^(k-1) == 1 (mod k) and lpf(k)-1 does not divide k-1.at n=10A316906
• Numbers k such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.at n=8A316907