cp's OEIS Frontend

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.

A387073 Record high points in A386482.

This page as a plain text file.
%I A387073 #9 Aug 16 2025 01:06:27
%S A387073 1,2,4,6,9,12,14,21,25,30,33,36,38,57,65,68,93,94,141,148,150,174,177,
%T A387073 236,244,247,260,316,393,415,428,515,635,685,951,1055,1067,1315,1388,
%U A387073 1516,1639,1828,1903,1969,2841,3235,3342,3414,3592,4516,4936,5948,7444,7652
%N A387073 Record high points in A386482.
%H A387073 Michael De Vlieger, <a href="/A387073/b387073.txt">Table of n, a(n) for n = 1..102</a>
%t A387073 Block[{c, j, k, m, p, r, nn},
%t A387073   nn = 6000; c[_] := False; m[_] := 1; j = 2; c[1] = c[2] = True; r = 0;
%t A387073   {1, 2}~Join~Monitor[Reap[Do[
%t A387073     If[PrimePowerQ[j],
%t A387073       Set[{p, k, m}, {#1, #1^(#2 - 1), #1^(#2 - 1)}] & @@
%t A387073         FactorInteger[j][[1]]; While[And[c[k*p], k != 0], k--];
%t A387073         If[k == 0, k = m; While[c[k*p], k++]]; k *= p,
%t A387073       k = j - 1; While[And[Or[c[k], CoprimeQ[j, k]], k != 1], k--];
%t A387073         If[k == 1, k += j; While[Or[c[k], CoprimeQ[j, k] ], k++] ] ];
%t A387073     If[k > r, r = k; Sow[k]];
%t A387073     Set[{c[k], j}, {True, k}], {n, 3, nn}] ][[-1, 1]], n] ]
%Y A387073 Cf. A386462, A387074.
%K A387073 nonn
%O A387073 1,2
%A A387073 _Michael De Vlieger_, Aug 15 2025