A087717 Start with x=n, then iterate the map x -> A322982(x) with A322982(x)=2*x-1 if x is noncomposite, otherwise A322982(x) = A032742(x), the largest proper divisor of x. If this iteration leads to a fixed point then a(n) is the value of that fixed point. If the iteration leads to a cycle, a(n) is the smallest value in the cycle. If the iteration never becomes periodic then a(n)=0.
1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 19, 3, 3, 3, 3, 3, 3, 3, 3, 3, 19, 3, 3, 3, 3, 3, 3, 3, 19, 19, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 19, 19, 3, 3, 3, 3, 3, 3, 3, 3, 19, 3, 3, 3, 3, 3, 19, 19, 3, 19, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 19, 3, 3, 3, 3, 3, 3, 3, 19, 3, 3, 3, 3, 3
Offset: 1
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 1..16384
- Antti Karttunen, Data supplement: n, a(n) computed for n = 1..100000
Crossrefs
Cf. A322982.
Programs
-
Mathematica
Which[Length@ Union@ #[[-2 ;; -1]] == 1, Last@ #, MemberQ[{3, 5, 9}, Last@ #], 3, MemberQ[{19, 37, 73, 145, 29, 57}, Last@ #], 19, True, 0] & /@ Array[NestWhileList[If[CompositeQ@ #, Divisors[#][[-2]], 2 # - 1] &, #, UnsameQ[##] &, All] &, 106] (* Michael De Vlieger, Jan 03 2019 *) -
PARI
A322982(n) = if((1==n)||isprime(n),n+n-1,n/vecmin(factor(n)[,1])); A087717(n) = { my(visited = Map(), visited_at_step = Map(), j=0, m=0, t); while(!mapisdefined(visited, n), mapput(visited, n, j); mapput(visited_at_step, j, n); j++; n = A322982(n)); for(k=mapget(visited,n), j-1, t = mapget(visited_at_step,k); if(!m || (t
Extensions
Name edited and the term a(1) = 1 prepended by Antti Karttunen, Jan 03 2019
Comments