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 A060413 #12 Oct 20 2019 21:49:25 %S A060413 1,4,7,59,81,105,135,164,165,173,176,183,224,246,287,292,298,308,376, %T A060413 395,398,433,447,547,550,606,688,712,722,728,886,902,966,990,1005 %N A060413 In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated dropping times. %H A060413 N. J. A. Sloane, <a href="/A060413/b060413.txt">Table of n, a(n) for n = 1..35</a> (from the web page of Tomás Oliveira e Silva) %H A060413 Tomás Oliveira e Silva, <a href="http://sweet.ua.pt/tos/3x+1.html">Tables</a> %H A060413 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a> %Y A060413 Cf. A126241, A060412. %K A060413 nonn %O A060413 1,2 %A A060413 _N. J. A. Sloane_, Apr 06 2001; b-file added Nov 27 2007