|
| |
|
|
A087717
|
|
Start with x=n, then iterate the mapping x->f(x) with f(x)=x/d if d<x, otherwise f(x)=2*x-1, where d is the smallest divisor d>1 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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
COMMENTS
| Conjecture. The iteration given in the definition above always leads to the 3-cycle {3,5,9,3} or the 6-cycle {19,37,73,145,29,57,19}, thus a(n) takes on only the values 3 or 19 for n=2,3,4,.... This has been verified to n=1000000.
|
|
|
CROSSREFS
| Sequence in context: A122553 A157831 A032552 * A053444 A130635 A175797
Adjacent sequences: A087714 A087715 A087716 * A087718 A087719 A087720
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| John W. Layman (layman(AT)math.vt.edu), Sep 29 2003
|
| |
|
|
