

A084735


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.


2



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, 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, 14, 22, 10, 14, 57, 22, 12, 15, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS



EXAMPLE

n=4: p = 7, q = 41, 41 has least primitive root 6, so a(4) = 6.


CROSSREFS



KEYWORD

nonn,easy


AUTHOR



EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com) and Don Reble, Jul 03 2003


STATUS

approved



