The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323831 a(0) = 5; thereafter a(n) is obtained by doubling a(n-1) and repeatedly deleting any string of identical digits. 2
 5, 10, 20, 40, 80, 160, 320, 640, 1280, 2560, 5120, 10240, 20480, 40960, 81920, 163840, 327680, 6360, 12720, 250, 5, 10, 20, 40, 80, 160, 320, 640, 1280, 2560, 5120, 10240, 20480, 40960, 81920, 163840, 327680, 6360, 12720, 250 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Periodic with period length 20. Conjecture: If we start with any nonnegative number, and repeatedly double it and apply the "repeatedly delete any run of identical digits" operation described here, we eventually reach one of 0, 1, or 5. In other words, the conjecture is that eventually we reach 0 or join the trajectory shown here or the trajectory shown in A323830. The number of steps to reach 0, 1, or 5 is given in A323832. LINKS FORMULA a(n+1) = A321801(2*a(n)). For general numbers, the "repeatedly delete any run of identical digits" operation corresponds to repeatedly applying A321801. - Chai Wah Wu, Feb 11 2019 CROSSREFS Cf. A000079, A320487, A321801, A321802, A323830, A323832. Sequence in context: A107486 A210677 A193839 * A020714 A146523 A102260 Adjacent sequences:  A323828 A323829 A323830 * A323832 A323833 A323834 KEYWORD nonn,base,easy AUTHOR N. J. A. Sloane, Feb 03 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 8 08:54 EDT 2020. Contains 333313 sequences. (Running on oeis4.)