A102423 Start at x=2n+1, iterate the map x -> A337349(x); sequence gives smallest number in the resulting cycle, or -1 if the trajectory never cycles.
1, 1, 1, 1, 1, 1, 1, 17, 17, 17, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 17, 1, 1, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 17, 17, 1, 1, 1, 1, 17, 17, 1, 1, 1, 1, 1, 17, 17, 1, 1, 1, 1, 1, 17, 17, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 0
Keywords
Links
- David A. Corneth, Table of n, a(n) for n = 0..9999
Programs
-
Mathematica
nextx[x_Integer] := Block[{a = x}, a = 3a + 1; While[EvenQ@a, a /= 2]; a = 3a - 1; While[EvenQ@a, a /= 2]; a]; f[n_] := NestWhile[nextx, n, FreeQ[{1, 17, 19, 43, 97, 109, 61}, # ] &]; Table[ If[ f[2n + 1] == 1, 1, 17], {n, 0, 94}] (* Robert G. Wilson v, Sep 20 2006; added 61 to comparison set used for detecting cycles, William P. Orrick, Aug 24 2020; should be "!" prefixing MemberQ, changed to FreeQ, Ray Chandler, Aug 28 2020 *)
Extensions
More terms from Robert G. Wilson v, Sep 20 2006
Comments