|
| |
|
|
A046145
|
|
Smallest primitive root of n, or 0 if no root exists.
|
|
13
| |
|
|
0, 0, 1, 2, 3, 2, 5, 3, 0, 2, 3, 2, 0, 2, 3, 0, 0, 3, 5, 2, 0, 0, 7, 5, 0, 2, 7, 2, 0, 2, 0, 3, 0, 0, 3, 0, 0, 2, 3, 0, 0, 6, 0, 3, 0, 0, 5, 5, 0, 3, 3, 0, 0, 2, 5, 0, 0, 0, 3, 2, 0, 2, 3, 0, 0, 0, 0, 2, 0, 0, 0, 7, 0, 5, 5, 0, 0, 0, 0, 3, 0, 2, 7, 2, 0, 0, 3, 0, 0, 3, 0, 0, 0, 0, 5, 0, 0, 5, 3, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| The value 0 at index 0 says 0 has no primitive roots, but the 0 at index 1 says 1 has a primitive root of 0, the only real 0 in the sequence.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..10000
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
|
MAPLE
| Contribution from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 08 2010: (Start)
A046145 := proc(n) if n <=1 then 0; else pr := numtheory[primroot](n) ; if pr = FAIL then return 0 ; else return pr ; end if; end if; end proc:
seq(A046145(n), n=0..110) ; (End)
|
|
|
CROSSREFS
| Cf. A001918, A046144, A046146.
Sequence in context: A118176 A005731 A132962 * A103309 A174621 A007967
Adjacent sequences: A046142 A046143 A046144 * A046146 A046147 A046148
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| Eric Weisstein (eric(AT)weisstein.com)
|
|
|
EXTENSIONS
| Initial terms corrected by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jan 27 2005
|
| |
|
|
