A138319 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A138319

Number of ways in which 2n can be represented as p+g, where p is a prime and g is a prime primitive root of p.

0, 0, 0, 1, 1, 1, 0, 0, 1, 2, 2, 2, 0, 2, 1, 2, 2, 0, 0, 2, 3, 1, 1, 4, 1, 2, 2, 2, 3, 2, 1, 0, 1, 1, 3, 3, 1, 1, 5, 1, 3, 3, 2, 2, 2, 2, 1, 3, 1, 0, 6, 4, 1, 5, 1, 3, 3, 2, 3, 5, 2, 2, 4, 1, 6, 5, 2, 2, 4, 1, 3, 0, 2, 2, 6, 1, 3, 7, 2, 5, 6, 1, 3, 5, 3, 4, 4, 2, 2, 7, 1, 4, 1, 1, 6, 5, 1, 0, 2, 3, 4, 5, 0, 4, 7

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,10

LINKS

T. D. Noe, Table of n, a(n) for n=1..10000

CROSSREFS

Cf. A138305 (prime primitive roots), A138306 (least p such that 2n=p+g).

Sequence in context: A274718 A028930 A112792 * A217864 A002100 A108352

Adjacent sequences: A138316 A138317 A138318 * A138320 A138321 A138322

KEYWORD

nonn

AUTHOR

T. D. Noe, Mar 14 2008

STATUS

approved