cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

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.

Original entry on oeis.org

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
Offset: 1

Views

Author

T. D. Noe, Mar 14 2008

Keywords

Crossrefs

Cf. A138305 (prime primitive roots), A138306 (least p such that 2n=p+g).
Showing 1-1 of 1 results.