login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000546 First occurrence of n consecutive numbers that take same number of steps to reach 1 in 3x+1 problem. 3
1, 12, 28, 314, 98, 386, 943, 1494, 1680, 4722, 6576, 11696, 3982, 2987, 17548, 36208, 7083, 59692, 159116, 79592, 57857, 212160, 352258, 221185, 57346, 294913, 252548, 530052, 331778, 524289, 1088129, 913319, 2065786, 1541308, 1032875, 1264924, 8151894 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Sequence is precise in the sense that n+1 consecutive numbers starting at a(n) do not take the same number of steps.
LINKS
MATHEMATICA
Collatz[n_] := Length[NestWhileList[If[EvenQ[#], #/2, 3 # + 1] &, n, # > 1 &]] - 1; nn = 10; t = Table[0, {nn}]; t[[1]] = 1; rep = 1; last = 0; n = 1; While[Times @@ t == 0, n++; r = Collatz[n]; If[r == last, rep++, If[0 < rep <= nn && t[[rep]] == 0, t[[rep]] = n - rep]; last = r; rep = 1]]; t (* T. D. Noe, Jun 20 2012 *)
CROSSREFS
Cf. A000547.
Sequence in context: A340685 A203026 A189539 * A130516 A045554 A174649
KEYWORD
nonn
AUTHOR
Peter L. Stone [ PetStone(AT)aol.com ]
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 02:46 EDT 2024. Contains 371917 sequences. (Running on oeis4.)