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 A387074 #7 Aug 16 2025 01:13:03 %S A387074 1,2,3,4,6,7,10,12,18,19,25,27,30,32,45,53,58,75,77,116,124,127,143, %T A387074 145,190,196,197,208,237,288,311,321,369,454,480,685,833,838,1035, %U A387074 1089,1207,1290,1426,1498,1533,2080,2668,2785,2888,3031,3782,4003,4965,5748 %N A387074 Indices of record high points in A386482. %H A387074 Michael De Vlieger, <a href="/A387074/b387074.txt">Table of n, a(n) for n = 1..102</a> %t A387074 Block[{c, j, k, m, p, r, nn}, %t A387074 nn = 6000; c[_] := False; m[_] := 1; j = 2; c[1] = c[2] = True; r = 0; %t A387074 {1, 2}~Join~Monitor[Reap[Do[ %t A387074 If[PrimePowerQ[j], %t A387074 Set[{p, k, m}, {#1, #1^(#2 - 1), #1^(#2 - 1)}] & @@ %t A387074 FactorInteger[j][[1]]; While[And[c[k*p], k != 0], k--]; %t A387074 If[k == 0, k = m; While[c[k*p], k++]]; k *= p, %t A387074 k = j - 1; While[And[Or[c[k], CoprimeQ[j, k]], k != 1], k--]; %t A387074 If[k == 1, k += j; While[Or[c[k], CoprimeQ[j, k] ], k++] ] ]; %t A387074 If[k > r, r = k; Sow[n]]; %t A387074 Set[{c[k], j}, {True, k}], {n, 3, nn}] ][[-1, 1]], n] ] %Y A387074 Cf. A386482, A387073. %K A387074 nonn %O A387074 1,2 %A A387074 _Michael De Vlieger_, Aug 15 2025