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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
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
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,19
LINKS
CROSSREFS
Cf. A060749 (primitive roots), A138325 (least p such that n=p+g).
Sequence in context: A046816 A352248 A301475 * A137264 A289014 A193238
KEYWORD
nonn
AUTHOR
T. D. Noe, Mar 14 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 18 11:53 EDT 2024. Contains 376000 sequences. (Running on oeis4.)