A271498 Smallest number in the trajectory of n under repeated application of the map k -> A271497(k).

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

Offset: 1

Author

N. J. A. Sloane, Apr 16 2016

Keywords

• nonn
• base

Comments

It appears that every number n eventually reaches one of the loops (1,2,3), (7,14,21), (31,62,93), ..., (2^(2*m-1)-1, 2^(2*m)-2, 3*(2^(2*m-1)-1)), ...

Links

• Chai Wah Wu, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A271497.