A060504 Let p be a prime that has a primitive root between 0 and p that is not also a primitive root of p^2 (A060503); sequence gives smallest such primitive root.

1, 14, 18, 19, 11, 43, 96, 68, 111, 78, 176, 165, 48, 79, 171, 147, 317, 14, 257, 159, 242, 175, 194, 210, 52, 10, 250, 486, 559, 556, 286, 534, 340, 526, 84, 375, 168, 467, 392, 446, 667, 682, 13, 657, 292, 127, 457, 208, 296, 419, 705, 158, 806, 508, 617

Offset

1,2

Links

Michel Marcus, Table of n, a(n) for n = 1..1000 (terms 1..201 from Davide Santoni)

Example

14 is a primitive root of 29 but not of 29^2.

Prog

(PARI) forprime(p=2, , for(a=1, p-1, if(znorder(Mod(a, p))==p-1&Mod(a, p^2)^(p-1)==1, print1(a, ", "); break()))) \\ Michel Marcus, Oct 13 2025; after A060503 PARI program

Crossrefs

Cf. A055578, A060503.

Sequence in context: A377439 A063828 A365792 * A052026 A317743 A118499

Adjacent sequences: A060501 A060502 A060503 * A060505 A060506 A060507

Keyword

nonn

Author

Jud McCranie, Mar 22 2001

Status

approved