login
a(n) is the smallest prime primitive root modulo A193305(n).
2

%I #10 Jan 18 2017 22:15:27

%S 3,5,2,3,3,5,7,2,7,2,3,3,5,3,3,5,3,3,5,2,7,3,5,3,3,11,2,7,2,7,7,5,3,2,

%T 5,2,3,5,3,5,5,11,3,7,2,3,3,17,3,3,3,3,7,5,3,5,7,3

%N a(n) is the smallest prime primitive root modulo A193305(n).

%C Values taken from A103309 (Robert Israel).

%C If there should be no prime primitive root for A193305(n) then a(n) = 0.

%e n = 1: 2^k (mod 4) is never 1 for k >=1. 3^1 = 3, 3^2 = 3^phi(4) = 9 == 1 (mod 4).

%Y Cf. A103309, A193305.

%K nonn

%O 1,1

%A _Wolfdieter Lang_, Jan 18 2017