A287875 Iterate the map x -> A230625(x) starting at n; sequence gives the first prime (or 1) that is reached, written in base 2, or -1 if no prime is ever reached.
1, 10, 11, 11111, 101, 1011, 111, 1011, 10111, 11111, 1011, 101011, 1101, 10111, 11101, 11111011, 10001, 10111, 10011, 11111011, 11111, 101011, 10111, 101111, 101011, 111001111, 11101, 10111, 11101, 1111111, 11111, 11111, 111011, 10111, 101111, 1111110011101, 100101
Offset: 1
Links
- Chai Wah Wu, Table of n, a(n) for n = 1..3931
Programs
-
Mathematica
Table[FromDigits@ IntegerDigits[#, 2] &@ If[n == 1, 1, NestWhile[FromDigits[#, 2] &@ Flatten@ Map[IntegerDigits[#, 2] &, FactorInteger[#] /. {p_, 1} :> {p}] &, n, ! PrimeQ@ # &, {2, 1}]], {n, 37}] (* Michael De Vlieger, Jun 24 2017 *)
Extensions
Changed the "escape" value from 0 to -1 to be consistent with A195264. - N. J. A. Sloane, Jul 27 2017
Comments