# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a135282
Showing 1-1 of 1

%I A135282 #27 Apr 16 2022 09:33:28
%S A135282 0,1,4,2,4,4,4,3,4,4,4,4,4,4,4,4,4,4,4,4,6,4,4,4,4,4,4,4,4,4,4,5,4,4,
%T A135282 4,4,4,4,4,4,4,6,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,6,4,4,4,4,
%U A135282 4,4,4,4,4,4,8,4,4,4,4,4,4,4,4,6,8,4,4
%N A135282 Largest k such that 2^k appears in the trajectory of the Collatz 3x+1 sequence started at n.
%C A135282 Most of the first eighty terms in the sequence are 4, because the trajectories finish with 16 -> 8 -> 4 -> 2 -> 1. - _R. J. Mathar_, Dec 12 2007
%C A135282 Most of the first ten thousand terms are 4, and there only appear 4, 6, 8, and 10 in the extent, unless n is power of 2. In the other words, it seems that the trajectory of the Collatz 3x + 1 sequence ends with either 16, 64, 256 or 1024. There are few exceptional terms, for example a(10920) = 12, a(10922) = 14. It also seems all terms are even unless n is an odd power of 2. - _Masahiko Shin_, Mar 16 2010
%C A135282 It is true that all terms are even unless n is an odd power of 2: 2 == -1 mod 3, 2 * 2 == -1 * -1 == 1 mod 3. Therefore only even-indexed powers of 2 are congruent to 1 mod 3 and thus reachable by either a halving step or a "tripling step," whereas the odd-indexed powers of 2 are only reachable by a halving step or as an initial value. - _Alonso del Arte_, Aug 15 2010
%H A135282 T. D. Noe, <a href="/A135282/b135282.txt">Table of n, a(n) for n = 1..10000</a>
%H A135282 <a href="/index/3#3x1">Index entries related to the 3x+1 (Collatz) problem</a>.
%F A135282 a(n) = A006577(n) - A208981(n) (after _Alonso del Arte_'s comment in A208981), if A006577(n) is not -1. - _Omar E. Pol_, Apr 10 2022
%e A135282 a(6) = 4 because the sequence is 6, 3, 10, 5, 16, 8, 4, 2, 1; there 16 = 2^4 is the largest power of 2 encountered.
%p A135282 A135282 := proc(n) local k,threen1 ; k := 0 : threen1 := n ; while threen1 > 1 do if 2^ilog[2](threen1) = threen1 then k := max(k,ilog[2](threen1)) ; fi ; if threen1 mod 2 = 0 then threen1 := threen1/2 ; else threen1 := 3*threen1+1 ; fi ; od: RETURN(k) ; end: for n from 1 to 80 do printf("%d, ",A135282(n)) ; od: # _R. J. Mathar_, Dec 12 2007
%t A135282 Collatz[n_] := If[EvenQ[n], n/2, 3*n + 1]; Log[2, Table[NestWhile[Collatz, n, ! IntegerQ[Log[2, #]] &], {n, 100}]] (* _T. D. Noe_, Mar 05 2012 *)
%o A135282 (C) #include <stdio.h> int main(){ int i, s, f; for(i = 2; i < 10000; i++){ f = 0; s = i; while(s != 1){ if(s % 2 == 0){ s = s/2; f++;} else{ f = 0; s = 3 * s + 1; } } printf("%d,", f); } return 0; } /* _Masahiko Shin_, Mar 16 2010 */
%o A135282 (Haskell)
%o A135282 a135282 = a007814 . head . filter ((== 1) . a209229) . a070165_row
%o A135282 -- _Reinhard Zumkeller_, Jan 02 2013
%Y A135282 Cf. A007814, A209229, A070165, A232503.
%Y A135282 Cf. A006577, A208981.
%K A135282 nonn
%O A135282 1,3
%A A135282 _Masahiko Shin_, Dec 02 2007
%E A135282 Edited and extended by _R. J. Mathar_, Dec 12 2007
%E A135282 More terms from _Masahiko Shin_, Mar 16 2010

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE