|
|
A271498
|
|
Smallest number in the trajectory of n under repeated application of the map k -> A271497(k).
|
|
3
|
|
|
1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 7, 1, 7, 7, 1, 1, 1, 1, 7, 1, 7, 7, 1, 1, 7, 7, 1, 7, 1, 1, 31, 7, 7, 1, 7, 1, 7, 7, 7, 1, 7, 7, 7, 7, 1, 7, 31, 1, 7, 7, 1, 7, 7, 1, 31, 7, 7, 7, 31, 1, 31, 31, 7, 7, 7, 7, 7, 7, 1, 7, 1, 1, 7, 7, 7, 7, 1, 7, 31, 7, 1, 7, 1, 7, 1, 1, 1, 7, 1, 1, 31, 1, 31, 31, 7, 7, 7, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
COMMENTS
|
It appears that every number n eventually reaches one of the loops (1,2,3), (7,14,21), (31,62,96), ..., (2^(2m)-1, 2^(2m+1)-2, 3(2^(2m)-1))), ...
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|