%I #8 Oct 19 2017 03:14:17
%S 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,
%T 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,
%U 14,22,10,14,57,22,12,15,6
%N Let p = nth prime, let q = smallest prime having p as its least prime primitive root; sequence gives least (not necessarily prime) primitive root of q.
%H A. Paszkiewicz and A. Schinzel, <a href="https://doi.org/10.1090/S0025571802013704">On the least prime primitive root modulo a prime</a>, Math. Comp. 71 (2002), no. 239, 13071321.
%e n=4: p = 7, q = 41, 41 has least primitive root 6, so a(4) = 6.
%Y Cf. A084739.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_, Jul 03 2003
%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com) and _Don Reble_, Jul 03 2003
