Riesel problem: a(n) = smallest m >= 0 such that n*2^m-1 is prime, or -1 if no such prime exists.

A040081

Riesel problem: a(n) = smallest m >= 0 such that n*2^m-1 is prime, or -1 if no such prime exists.

Terms

    a(0) =2a(1) =1a(2) =0a(3) =0a(4) =2a(5) =0a(6) =1a(7) =0a(8) =1a(9) =1a(10) =2a(11) =0a(12) =3a(13) =0a(14) =1a(15) =1a(16) =2a(17) =0a(18) =1a(19) =0a(20) =1a(21) =1a(22) =4a(23) =0a(24) =3a(25) =2a(26) =1a(27) =3a(28) =4a(29) =0

External references