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 A365483 #12 Sep 25 2023 09:03:38 %S A365483 4616,707118223359971240,3562942561397226080, %T A365483 103968231672274974522437732,126114763591721667597212096, %U A365483 1823036311464280263720932141024,175294593968539094415936960141122,32012333661096566765082938647132369010 %N A365483 In the Collatz (3x+1) problem, maximum excursion values corresponding to the starting points given by A365482. %C A365483 See A365482 for corresponding maximum excursion ratios and additional information. %H A365483 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a> %F A365483 a(n) = A365478(A365482(n)). %Y A365483 Subsequence of A060410. %Y A365483 Cf. A365478, A365482. %K A365483 nonn,hard,more %O A365483 1,1 %A A365483 _Paolo Xausa_, Sep 05 2023