This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A279398 #10 Jan 18 2017 22:15:27 %S A279398 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 A279398 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 A279398 a(n) is the smallest prime primitive root modulo A193305(n). %C A279398 Values taken from A103309 (Robert Israel). %C A279398 If there should be no prime primitive root for A193305(n) then a(n) = 0. %e A279398 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 A279398 Cf. A103309, A193305. %K A279398 nonn %O A279398 1,1 %A A279398 _Wolfdieter Lang_, Jan 18 2017