Riesel problem: Smallest prime of form n*2^m-1, m >= 0, or 0 if no such prime exists.

Terms

a(0) =3a(1) =3a(2) =2a(3) =3a(4) =19a(5) =5a(6) =13a(7) =7a(8) =17a(9) =19a(10) =43a(11) =11a(12) =103a(13) =13a(14) =29a(15) =31a(16) =67a(17) =17a(18) =37a(19) =19a(20) =41a(21) =43a(22) =367a(23) =23a(24) =199a(25) =103a(26) =53a(27) =223a(28) =463a(29) =29