Start with n and repeatedly apply the map k -> T(k) = A053837(k) + A171765(k); a(n) is the number of steps (at least one) until a prime is reached, or 0 if no prime is ever reached.

A074871

Start with n and repeatedly apply the map k -> T(k) = A053837(k) + A171765(k); a(n) is the number of steps (at least one) until a prime is reached, or 0 if no prime is ever reached.

Terms

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

External references