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

A074807

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

Terms

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

External references