|
Search: id:A111725
|
|
|
| A111725 |
|
Number of elements modulo n of the maximum order. |
|
+0
1
|
|
| 0, 1, 1, 1, 2, 1, 2, 3, 2, 2, 4, 3, 4, 2, 4, 4, 8, 2, 6, 4, 6, 4, 10, 7, 8, 4, 6, 6, 12, 4, 8, 8, 12, 8, 8, 6, 12, 6, 8, 8, 16, 6, 12, 12, 8, 10, 22, 8, 12, 8, 16, 8, 24, 6, 16, 14, 18, 12, 28, 8, 16, 8, 24, 16, 24, 12, 20, 16, 30, 8, 24, 14, 24, 12, 16, 18, 24, 8, 24, 24, 18, 16, 40, 14, 32, 12
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
The maximum order modulo n is given by A002322.
For prime n, a(n) = phi(phi(n)) = A010554(n) = phi(n-1). - Nick Hobson (nickh(AT)qbyte.org), Jan 09 2007
|
|
LINKS
|
S. R. Finch, Idempotents and Nilpotents Modulo n (arXiv:math.NT/0605019)
|
|
PROGRAM
|
(PARI) { a(n) = local(f, r, c, r1); f=factorint(n); r=1; c=0; for(k=1, n-1, if(gcd(k, n)!=1, next); r1=1; for(i=1, matsize(f)[1], r1=lcm(r1, znorder(Mod(k, f[i, 1]^f[i, 2]))) ); if(r1==r, c++); if(r1>r, r=r1; c=1) ); c }
|
|
CROSSREFS
|
Cf. A002322.
Cf. A008330.
Sequence in context: A104889 A117910 A029267 this_sequence A112218 A132148 A103342
Adjacent sequences: A111722 A111723 A111724 this_sequence A111726 A111727 A111728
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Max Alekseyev (maxal(AT)cs.ucsd.edu), Nov 18 2005
|
|
|
Search completed in 0.002 seconds
|
