Smallest prime number, not already in sequence, such that the product M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod M).

A058910

Smallest prime number, not already in sequence, such that the product M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod M).

Terms

    a(0) =3a(1) =5a(2) =17a(3) =257a(4) =641a(5) =1217a(6) =14593a(7) =167809a(8) =671233a(9) =1314497a(10) =180449537a(11) =424050817

External references