|
| |
|
|
A068494
|
|
n reduced mod phi(n).
|
|
2
| |
|
|
0, 0, 1, 0, 1, 0, 1, 0, 3, 2, 1, 0, 1, 2, 7, 0, 1, 0, 1, 4, 9, 2, 1, 0, 5, 2, 9, 4, 1, 6, 1, 0, 13, 2, 11, 0, 1, 2, 15, 8, 1, 6, 1, 4, 21, 2, 1, 0, 7, 10, 19, 4, 1, 0, 15, 8, 21, 2, 1, 12, 1, 2, 27, 0, 17, 6, 1, 4, 25, 22, 1, 0, 1, 2, 35, 4, 17, 6, 1, 16, 27, 2, 1, 12, 21, 2, 31, 8, 1, 18, 19, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,9
|
|
|
COMMENTS
| By Lehmer's Conjecture, when n>2 then a(n) = 1 if and only if n is prime. The Notices article states "Lehmer's Conjecture (1932). phi(n) | (n-1) if and only if n is prime." - Michael Somos, Oct 14 2011
|
|
|
REFERENCES
| D. H. Bailey and J. M. Borwein, Notices of A. M. S. 58 (2011) 1410-1419, see p. 1416
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
PROG
| (PARI) for(n=1, 150, print1(n%eulerphi(n), ", "))
(PARI) {a(n) = if( n<1, 0, n % eulerphi(n))} /* Michael Somos, Oct 14 2011 */
(Haskell)
a068494 n = mod n $ a000010 n -- Reinhard Zumkeller, Oct 14 2011
|
|
|
CROSSREFS
| Sequence in context: A194703 A022959 A023445 * A195040 A083721 A158459
Adjacent sequences: A068491 A068492 A068493 * A068495 A068496 A068497
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 11 2002
|
| |
|
|
