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.

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

Original entry on oeis.org

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

Views

Author

T. D. Noe, Mar 14 2008

Keywords

Crossrefs

Cf. A060749 (primitive roots), A138325 (least p such that n=p+g).
Showing 1-1 of 1 results.