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!)
 A072466 Numbers with 11 odd integers in their Collatz (or 3x+1) trajectory. 0

%I

%S 57,59,114,115,118,119,228,229,230,236,237,238,456,458,460,461,465,

%T 472,473,474,476,477,507,513,912,916,917,920,922,930,931,943,944,945,

%U 946,947,948,949,952,954,971,987,1014,1015,1025,1026,1027,1031,1129,1131

%N Numbers with 11 odd integers in their Collatz (or 3x+1) trajectory.

%C The Collatz (or 3x+1) function is f(x) = x/2 if x is even, 3x+1 if x is odd. The Collatz trajectory of n is obtained by applying f repeatedly to n until 1 is reached.

%D J. Shallit and D. Wilson, The "3x+1" Problem and Finite Automata, Bulletin of the EATCS #46 (1992) pp. 182-185.

%H J. Shallit and D. Wilson, <a href="http://www.cs.uwaterloo.ca/~shallit/Papers/wilson.ps">The "3x+1" Problem and Finite Automata</a>, Bulletin of the EATCS #46 (1992) pp. 182-185.

%H <a href="/index/Ar#2-automatic">Index entries for 2-automatic sequences</a>.

%t ocollQ[n_]:=Length[Select[NestWhileList[If[EvenQ[#],#/2,3#+1]&,n,#>1&],OddQ[#]&]]==11; Select[Range[1140],ocollQ[#]&] (* _Jayanta Basu_, May 28 2013 *)

%Y Cf. A062052-A062060.

%K easy,nonn

%O 1,1

%A _Jim Nastos_, Jun 19 2002

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 August 14 07:04 EDT 2020. Contains 336477 sequences. (Running on oeis4.)