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 A060415 #12 Oct 20 2019 21:51:29 %S A060415 0,2,3,45,48,20,78,124,95,103,62,147,186,36,168,65,60,179,41,146,254, %T A060415 254,319,346,423,166,297,206,223,164,659,607,840,808,512 %N A060415 In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start. %H A060415 N. J. A. Sloane, <a href="/A060415/b060415.txt">Table of n, a(n) for n = 1..35</a> (from the web page of Tomás Oliveira e Silva) %H A060415 Tomás Oliveira e Silva, <a href="http://sweet.ua.pt/tos/3x+1.html">Tables</a> %H A060415 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a> %Y A060415 Cf. A060412, A060413, A060414. %K A060415 nonn %O A060415 1,2 %A A060415 _N. J. A. Sloane_, Apr 06 2001; b-file added Nov 27 2007 %E A060415 Corrected by _Don Reble_, May 13 2006