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.

A378028 Positions of records in A377059.

Original entry on oeis.org

1, 4, 9, 17, 22, 25, 46, 49, 81, 118, 121, 169, 243, 334, 337, 343, 361, 529, 841, 961, 1331, 1369, 2187, 2197, 2209, 2809, 3481, 3721, 4489, 5041, 6241, 6859, 6889, 7921, 10201, 11449, 12167, 14641, 16129, 17161, 19321, 22201, 24389, 26569, 27889, 29791, 29929, 32041, 32761, 38809, 39601, 44521, 49729
Offset: 1

Views

Author

Robert Israel, Nov 14 2024

Keywords

Comments

Numbers k such that A377059(k) > A377059(j) for all j < k.
The record values are in A378029.
It appears that in most cases a(n) is in A244623 (Odd prime powers that are not primes) and A378029(n) = A000010(a(n)).
If p is in A001122 and is not a Wieferich prime (A001220), then p^2 is a term with A377059(p^2) = p*(p-1).

Examples

			a(3) = 9 is a term because A377059(9) = 6 > A377059(k) for all k < 9.
		

Crossrefs

Programs

  • Maple
    f:= proc(n) local x,r;
      for x from 2 to n do
        if igcd(x,n) <> 1 then next fi;
        r:= numtheory:-order(x,n);
        if r::even and r < n-1 then return r fi
      od;
      0
    end proc:
    J:= 1: m:= 0: count:= 0:
    for k from 2 while count < 100 do
    v:= f(k);
    if v > m then m:= v; J:= J,k; count:= count+1 fi;
    od:
    J;

Formula

A378029(n) = A377059(a(n)).