Riesel problem: start with n; repeatedly double and add 1 until reach a prime. Sequence gives a(n) = prime reached, or 0 if no prime is ever reached.

A052333

Riesel problem: start with n; repeatedly double and add 1 until reach a prime. Sequence gives a(n) = prime reached, or 0 if no prime is ever reached.

Terms

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

External references