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.

A138325 Least prime p such that n = p + g, where g is a primitive root of p, or 0 if there is no such prime p.

Original entry on oeis.org

0, 0, 2, 0, 3, 0, 5, 5, 0, 7, 0, 7, 11, 0, 13, 0, 11, 11, 11, 13, 19, 17, 17, 13, 0, 0, 17, 17, 17, 23, 17, 19, 19, 19, 0, 0, 23, 23, 29, 23, 0, 23, 23, 23, 0, 43, 29, 29, 0, 29, 0, 31, 31, 37, 29, 29, 37, 41, 37, 41, 37, 43, 41, 0, 41, 47, 41, 61, 37, 41, 41, 37, 43, 53, 41, 41, 43, 47
Offset: 1

Views

Author

T. D. Noe, Mar 14 2008

Keywords

Comments

Sequence A138128 gives the number of representations for each n and sequence A138326 lists the values of n that are not represented.

Crossrefs

Cf. A060749 (primitive roots).
Showing 1-1 of 1 results.