login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A378846
Smallest starting x which takes n halving steps to reach the minimum of a cycle in the 3x-1 iteration.
3
1, 2, 4, 3, 6, 11, 13, 9, 18, 35, 25, 47, 33, 63, 45, 81, 95, 117, 127, 85, 57, 113, 133, 89, 97, 65, 129, 87, 173, 225, 231, 293, 309, 377, 261, 273, 545, 671, 465, 485, 597, 647, 741, 529, 353, 705, 471, 941, 1029, 1241, 837, 577, 385, 257, 513, 343, 229, 153
OFFSET
0,2
COMMENTS
Each step is x -> 3x-1 if x odd, or x -> x/2 if x even (A001281) and here only the halving steps x/2 are counted.
The number of halving steps is A377524(x) so that a(n) = x is the smallest x for which A377524(x) = n.
a(n) <= 2*a(n-1) is an upper bound since x = 2*a(n-1) is a candidate for a(n) by first step x -> x/2.
All even terms are a(n) = 2*a(n-1), since any smaller even a(n) would imply a smaller a(n-1) by first step x -> x/2.
No term is of the form y = 6*k + 2, apart from a(1)=2, since odd x = 2*k+1 takes a tripling step to 3*x-1 = y and x is a smaller start with the same number of halvings as y.
LINKS
Kevin Ryde, C Code (set count type HALF)
PROG
(C) /* See links. */
CROSSREFS
Cf. A001281 (step), A377524 (number of halving steps).
Cf. A378845 (with all steps), A378847 (with tripling steps).
Sequence in context: A064273 A257986 A327743 * A232564 A134561 A258046
KEYWORD
nonn
AUTHOR
Kevin Ryde, Dec 15 2024
STATUS
approved