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

A074727

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

Terms

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

External references