Riesel problem: start with n; repeatedly double and add 1 until reaching a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.

A050412

Riesel problem: start with n; repeatedly double and add 1 until reaching a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.

Terms

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

External references