Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + floor(log(n)) + 1, otherwise 2n - floor(log(n)) - 1; or -1 if no prime is ever reached.

A073756

Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + floor(log(n)) + 1, otherwise 2n - floor(log(n)) - 1; or -1 if no prime is ever reached.

Terms

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

External references