This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A092892 #25 Feb 16 2025 08:32:53
%S A092892 1,2,4,8,5,3,6,12,24,17,11,7,14,9,18,36,25,49,33,65,43,86,57,39,78,
%T A092892 153,105,203,135,270,185,123,246,169,329,219,159,295,569,379,283,505,
%U A092892 377,251,167,111,222,444,297,593,395,263,175,350,233,155,103,206,137,91,182
%N A092892 Smallest starting value in a Collatz '3x+1' sequence such that the sequence contains exactly n halving steps.
%C A092892 First occurrence of n in A006666.
%C A092892 The graph of this sequence has features similar to those of A092893, but with the x-axis scaled by log(3)/log(2). - _T. D. Noe_, Apr 09 2007
%H A092892 T. D. Noe, <a href="/A092892/b092892.txt">Table of n, a(n) for n=0..500</a>
%H A092892 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CollatzProblem.html">Collatz Problem.</a>
%H A092892 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%e A092892 a(5)=3 because the Collatz sequence 3,10,5,16,8,4,2,1 is the first sequence containing 5 halving steps.
%t A092892 coll[n_]:= NestWhileList[If[EvenQ[#], #/2, 3#+1] &, n, #>1 &]; Table[i = 1; While[Count[coll[i], _?EvenQ] != n, i++]; i, {n, 0, 60}] (* _Jayanta Basu_, Jun 05 2013 *)
%o A092892 (Haskell)
%o A092892 import Data.List (elemIndex); import Data.Maybe (fromJust)
%o A092892 a092892 = (+ 1) . fromJust . (`elemIndex` a006666_list)
%o A092892 -- _Reinhard Zumkeller_, Mar 14 2014
%Y A092892 Cf. A006666, A092893.
%K A092892 nonn,look
%O A092892 0,2
%A A092892 _Hugo Pfoertner_, Mar 11 2004