OFFSET
1,2
COMMENTS
Compare with enigmatic similarity of this and analogous odd-th power counts to A055653.
This sequence is multiplicative [Li]. - Leon P Smith, Apr 16 2005
LINKS
T. D. Noe, Table of n, a(n) for n = 1..1000
S. Li, On the number of elements with maximal order in the multiplicative group modulo n, Acta Arithm. 86 (2) (1998) 113, see proof of theorem 2.1
MAPLE
A085314 := proc(m)
{seq( modp(b^11, m), b=0..m-1) };
nops(%) ;
end proc:
seq(A085314(m), m=1..100) ; # R. J. Mathar, Sep 22 2017
MATHEMATICA
a[n_] := Table[PowerMod[i, 11, n], {i, 0, n - 1}] // Union // Length;
Array[a, 100] (* Jean-François Alcover, Mar 25 2020 *)
PROG
(PARI) a(n)=my(f=factor(n)); prod(i=1, #f[, 1], my(k=f[i, 1]^f[i, 2]); #vecsort(vector(k, i, i^11%k), , 8)) \\ Charles R Greathouse IV, Sep 05 2013
CROSSREFS
KEYWORD
nonn,mult
AUTHOR
Labos Elemer, Jun 27 2003
STATUS
approved