A084735 Let p = n-th prime, let q = smallest prime having p as its least prime primitive root; sequence gives least (not necessarily prime) primitive root of q.

2, 3, 5, 6, 6, 13, 17, 19, 10, 21, 10, 14, 6, 6, 6, 6, 38, 12, 6, 22, 6, 10, 69, 6, 44, 6, 35, 10, 14, 33, 6, 10, 10, 18, 14, 6, 33, 14, 33, 18, 94, 15, 38, 15, 22, 6, 6, 6, 6, 6, 6, 12, 14, 22, 10, 14, 57, 22, 12, 15, 6

Offset

1,1

Links

Table of n, a(n) for n=1..61.

A. Paszkiewicz and A. Schinzel, On the least prime primitive root modulo a prime, Math. Comp. 71 (2002), no. 239, 1307-1321.

Example

n=4: p = 7, q = 41, 41 has least primitive root 6, so a(4) = 6.

Crossrefs

Cf. A084739.

Sequence in context: A128054 A175081 A023834 * A002734 A367417 A339949

Adjacent sequences: A084732 A084733 A084734 * A084736 A084737 A084738

Keyword

nonn,easy

Author

N. J. A. Sloane, Jul 03 2003

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com) and Don Reble, Jul 03 2003

Status

approved