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,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

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

Crossrefs

Cf. A271497,

Sequence in context: A348504 A344696 A336457 * A365332 A367483 A348281

Adjacent sequences: A271495 A271496 A271497 * A271499 A271500 A271501

Keyword

nonn,base

Author

N. J. A. Sloane, Apr 16 2016

Status

approved