|
|
A185450
|
|
Define a map of the integers by T_k(i)=i/2 if i even, (3i+k)/2 if i odd; a(n) is the conjectured number of cycles for trajectories under this map in the case k = 5^n.
|
|
1
|
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The values are only (strong) conjectures; showing that there are correct will be about as hard as solving the famous "3x+1" problem.
|
|
REFERENCES
|
J. C. Lagarias, ed., The Ultimate Challenge: The 3x+1 Problem, Amer. Math. Soc., 2010; see page 88.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|