Let f(n) = (2n+1), g(n) = (n-1)/2. Then a(n) = f(f(f(...(n)))), where one gets prime at every step. If f(n) is not a prime then a(n) = g(g(g...(n)))) where one gets a prime at every step. If f(n) and g(n) both are composite then a(n) = 0.
A089725
Let f(n) = (2n+1), g(n) = (n-1)/2. Then a(n) = f(f(f(...(n)))), where one gets prime at every step. If f(n) is not a prime then a(n) = g(g(g...(n)))) where one gets a prime at every step. If f(n) and g(n) both are composite then a(n) = 0.
Terms
- a(0) =7a(1) =47a(2) =7a(3) =0a(4) =47a(5) =13a(6) =3a(7) =17a(8) =19a(9) =0a(10) =47a(11) =0a(12) =0a(13) =59a(14) =31a(15) =0a(16) =0a(17) =37a(18) =0a(19) =167a(20) =43a(21) =0a(22) =47a(23) =0a(24) =0a(25) =107a(26) =13a(27) =0a(28) =59a(29) =61
External references
- oeis: A089725