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 A241516 #6 Apr 25 2014 00:02:57
%S A241516 1,2,2,3,2,2,3,2,5,2,3,2,7,3,5,2,2,2,2,7,5,3,2,3,5,2,5,2,11,3,3,2,3,2,
%T A241516 2,7,5,2,5,2,2,2,22,5,2,3,2,3,2,7,3,7,7,11,3,5,2,15,5,3,3,2,5,22,15,2,
%U A241516 3,15,2,2,3,7,11,2,2,5,2,5,3,22
%N A241516 Least positive primitive root g < prime(n) modulo prime(n) which is also a partition number given by A000041, or 0 if such a number g does not exist.
%C A241516 According to the conjecture in A241504, a(n) should be always positive.
%H A241516 Zhi-Wei Sun, <a href="/A241516/b241516.txt">Table of n, a(n) for n = 1..10000</a>
%H A241516 Zhi-Wei Sun, <a href="http://arxiv.org/abs/1402.6641">Problems on combinatorial properties of primes</a>, arXiv:1402.6641, 2014.
%e A241516 a(4) = 3 since 3 = A000041(3) is a primitive root modulo prime(4) = 7, but neither 1 = A000041(1) nor 2 = A000041(2) is.
%t A241516 f[k_]:=PartitionsP[k]
%t A241516 dv[n_]:=Divisors[n]
%t A241516 Do[Do[If[f[k]>Prime[n]-1,Goto[cc]];Do[If[Mod[f[k]^(Part[dv[Prime[n]-1],i]),Prime[n]]==1,Goto[aa]],{i,1,Length[dv[Prime[n]-1]]-1}];Print[n," ",PartitionsP[k]];Goto[bb];Label[aa];Continue,{k,1,Prime[n]-1}];Label[cc];Print[Prime[n]," ",0];Label[bb];Continue,{n,1,80}]
%Y A241516 Cf. A000040, A000041, A237121, A239957, A239963, A241476, A241492, A241504.
%K A241516 nonn
%O A241516 1,2
%A A241516 _Zhi-Wei Sun_, Apr 24 2014