Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + #(n) + 1, otherwise 2n - #(n) - 1, where #(n) is the number of digits of n; or -1 is no prime is ever reached.
A073754
Number of steps needed to reach a prime when the following map is repeatedly applied to n: if n is even then 2n + #(n) + 1, otherwise 2n - #(n) - 1, where #(n) is the number of digits of n; or -1 is no prime is ever reached.
Terms
- a(0) =3a(1) =3a(2) =2a(3) =12a(4) =2a(5) =10a(6) =11a(7) =3a(8) =1a(9) =1a(10) =9a(11) =1a(12) =1a(13) =9a(14) =2a(15) =1a(16) =10a(17) =2a(18) =1a(19) =10a(20) =1a(21) =1a(22) =8a(23) =1a(24) =2a(25) =8a(26) =1a(27) =2a(28) =13a(29) =1
External references
- oeis: A073754