Numbers k such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.
A316907
Numbers k such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.
Terms
- a(0) =7957a(1) =23377a(2) =35333a(3) =42799a(4) =49981a(5) =60787a(6) =129889a(7) =150851a(8) =162193a(9) =164737a(10) =241001a(11) =249841a(12) =253241a(13) =256999a(14) =280601a(15) =318361a(16) =452051a(17) =481573a(18) =556169a(19) =580337a(20) =617093a(21) =665333a(22) =722201a(23) =838861a(24) =877099a(25) =1016801a(26) =1251949a(27) =1252697a(28) =1325843a(29) =1507963
External references
- oeis: A316907