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 A365503 #7 Sep 25 2023 09:04:47 %S A365503 0,2,5,6,41,164,189,195,207,222,228,248,256,357,583,686,850 %N A365503 In the Collatz (3x+1) problem, number of odd iterates before reaching 1 corresponding to the starting points given by A248037. %C A365503 Except for a(1), these values are listed in the fourth column of Table 1 in Kontorovich and Lagarias (2009, 2010). %C A365503 See A365502 for corresponding total stopping times. %H A365503 Alex V. Kontorovich and Jeffrey C. Lagarias, <a href="https://arxiv.org/abs/0910.1944">Stochastic Models for the 3x+1 and 5x+1 Problems</a>, arXiv:0910.1944 [math.NT], 2009, pp. 9-11, and in Jeffrey C. Lagarias, ed., <a href="http://www.ams.org/bookstore-getitem/item=mbk-78">The Ultimate Challenge: The 3x+1 Problem</a>, American Mathematical Society, 2010, pp. 138-140. %H A365503 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a> %F A365503 a(n) = A006667(A248037(n)). %Y A365503 Subsequence of A006667. %Y A365503 Cf. A014682, A248037, A365502. %K A365503 nonn,hard,more %O A365503 1,2 %A A365503 _Paolo Xausa_, Sep 06 2023