OFFSET
0,1
COMMENTS
Starting from 26, iteration of A385938 returns to 26 after exactly 130 steps.
The dynamical system has four attractors: fixed point 1, and cycles of lengths 10, 68, and 130.
Any element in this cycle generates the complete 130-elements cycle when iterated.
LINKS
Miquel Cerda, Table of n, a(n) for n = 0..129
FORMULA
a(0) = 26; a(n) = A385938(a(n-1)) for n >= 1.
EXAMPLE
Starting from 26: f(26) = (7*26+1)/3 = 61, f(61) = (2*61+1)/3 = 41, continuing this process yields the 130-element cycle.
MATHEMATICA
f[x_] := Which[Mod[x, 3] == 0, 2*x/3, Mod[x, 3] == 1, (2*x + 1)/3, Mod[x, 3] == 2, (7*x + 1)/3]; NestList[f, 26, 129]
PROG
(PARI) my(v=vector(130)); v[1]=26; for(i=2, 130, x=v[i-1]; v[i]=if(x%3==0, 2*x/3, if(x%3==1, (2*x+1)/3, (7*x+1)/3))); v;
CROSSREFS
KEYWORD
nonn,easy,fini,full
AUTHOR
Miquel Cerda, Jul 12 2025
STATUS
approved
