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 A346593 #18 Jul 28 2021 19:01:58
%S A346593 2,3,6,7,14,15,25,41,45,71,79,153,233,235,470,503,707,741,1482,2964,
%T A346593 3039,3581,7162,14324,27337,54674,61683,123366,168159,254251,302839,
%U A346593 605678,622699,947173,1618687,3237374,6474748,10995401,13042083,21767875,43535750,48584565
%N A346593 Numbers k such that A006577(k^3) sets a new record.
%H A346593 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%t A346593 s[n_]:=s[n]=(i=0;r=n;While[r!=1,i++;If[EvenQ@r,r=r/2,r=r*3+1]];i);
%t A346593 lst={};max=1;Do[t=s[k^3];If[t>max,AppendTo[lst,k];max=t],{k,10^4}];lst (* _Giorgos Kalogeropoulos_, Jul 28 2021 *)
%o A346593 (PARI) a6577(n0)={my(n=n0,k=0);while(n>1,k++;n=if(n%2,3*n+1,n/2));k};
%o A346593 a346593(limit)={msteps=0;for(k=1,limit,my(m=a6577(k^3));if(m>msteps,print1(k,", ");msteps=m))};
%o A346593 a346593(1000000)
%Y A346593 Cf. A006577, A006877, A244638, A346591, A346592.
%K A346593 nonn
%O A346593 1,1
%A A346593 _Hugo Pfoertner_, Jul 28 2021