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.

Showing 1-1 of 1 results.

A371730 Indices of records in A371729: numbers k with A371729(k) > A371729(m) for all m < k.

Original entry on oeis.org

2, 5, 9, 13, 17, 25, 37, 41, 49, 73, 97, 109, 161, 181, 289, 307, 361, 433, 529, 701, 841, 881, 961, 1189, 1369, 1681, 1849, 2209, 2393, 2449, 3277, 3457, 3781, 4096, 4159, 4841, 4861, 5741, 5851, 6049, 7921, 10201, 11449, 11881, 15049, 15401, 19601, 27026, 32768
Offset: 1

Views

Author

Amiram Eldar, Apr 05 2024

Keywords

Comments

The corresponding record values are 0, 1, 2, 3, 4, 5, 7, 8, 9, 11, 12, ... (see the link for more values).

Crossrefs

Cf. A371729.

Programs

  • Mathematica
    f[k_] := Count[Range[4, k - 1], ?(CompositeQ[#] && PowerMod[k, # - 1, #] == 1 &)]; seq[kmax] := Module[{s = {}, fm = -1, f1}, Do[f1 = f[k]; If[f1 > fm, fm = f1; AppendTo[s, k]], {k, 2, kmax}]; s]; seq[2500]
  • PARI
    f(n) = {my(c=0); forcomposite(k = 4, n-1, if(Mod(n, k)^(k-1) == 1, c++)); c;}
    lista(kmax) = {my(fm = -1, f1); for(k = 2, kmax, f1 = f(k); if(f1 > fm, fm = f1; print1(k, ", ")));}
Showing 1-1 of 1 results.