id:A138328 - OEIS Search Results

Search: id:A138328

Displaying 1-1 of 1 results found.

page 1

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.

+0
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; listen)

	OFFSET	`1,19`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	CROSSREFS	`Cf. A060749 (primitive roots), A138325 (least p such that n=p+g).` `Sequence in context: A087775 A089955 A046816 this_sequence A137264 A167678 A078614` `Adjacent sequences: A138325 A138326 A138327 this_sequence A138329 A138330 A138331`
	KEYWORD	`nonn`
	AUTHOR	`T. D. Noe (noe(AT)sspectra.com), Mar 14 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research