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.

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.

Terms

    a(0) =2a(1) =3a(2) =5a(3) =6a(4) =6a(5) =13a(6) =17a(7) =19a(8) =10a(9) =21a(10) =10a(11) =14a(12) =6a(13) =6a(14) =6a(15) =6a(16) =38a(17) =12a(18) =6a(19) =22a(20) =6a(21) =10a(22) =69a(23) =6a(24) =44a(25) =6a(26) =35a(27) =10a(28) =14a(29) =33

External references