A378592 a(n) is the first number that is the largest primitive root modulo exactly n numbers.

4, 1, 3, 47, 5

Offset

0,1

Comments

a(n) is the first number that occurs exactly n times in A306253.

Is there any number that occurs more than 4 times in A306253?

Links

Table of n, a(n) for n=0..4.

Example

4 is not the largest primitive root mod any number.
1 is the largest primitive root mod 2.
3 is the largest primitive root mod 4 and mod 5.
47 is the largest primitive root mod 49, 50, and 54.
5 is the largest primitive root mod 6, 7, 9, and 14.

Maple

f:= proc(b) local x, t;
  t:= numtheory:-phi(b);
  for x from b-1 by -1 do if igcd(x, b) = 1 and numtheory:-order(x, b)=t then return x fi od
end proc:
f(1):= 0:
cands:= select(t -> t=1 or numtheory:-primroot(t) <> FAIL, [$1..1000]):
R:= map(f, cands):
S:= sort(convert(convert(R, set), list)):
V:= Array(0..10): V[0]:= 4:
for s in S do
  v:= numboccur(s, R);
  if  V[v] = 0 then V[v]:= s fi
od:
convert(V, list); # Robert Israel, Dec 01 2024

Crossrefs

Cf. A306253.

Sequence in context: A301510 A085471 A064221 * A229672 A298568 A152890

Adjacent sequences: A378588 A378589 A378591 * A378593 A378594 A378595

Keyword

nonn,more,new

Author

Robert Israel, Dec 01 2024

Status

approved