|
|
A047935
|
|
Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of g.
|
|
3
|
|
|
1, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 2, 6, 2, 6, 10, 2, 6, 2, 2, 2, 6, 2, 2, 6, 6, 2, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6, 2, 6, 2, 6, 6, 2, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 10, 2, 2, 2, 2, 6, 2, 6, 2, 2, 2, 2, 6, 2, 2, 2, 2, 10, 6, 10, 2, 2, 2, 10, 2, 2, 2, 6, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 864.
|
|
LINKS
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
|
|
EXAMPLE
|
11 has primitive root 2 and 11+2 = 13 is prime after 11, which contributes a 2 to the sequence.
|
|
MATHEMATICA
|
f[p_] := {g = PrimitiveRoot[p], p + g == NextPrime[p]};
|
|
CROSSREFS
|
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|