|
|
A293484
|
|
The number of 7th powers in the multiplicative group modulo n.
|
|
5
|
|
|
1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10, 4, 12, 6, 8, 8, 16, 6, 18, 8, 12, 10, 22, 8, 20, 12, 18, 12, 4, 8, 30, 16, 20, 16, 24, 12, 36, 18, 24, 16, 40, 12, 6, 20, 24, 22, 46, 16, 6, 20, 32, 24, 52, 18, 40, 24, 36, 4, 58, 16, 60, 30, 36, 32, 48, 20, 66, 32, 44, 24, 10, 24, 72, 36, 40, 36
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
The size of the set of numbers j^7 mod n, gcd(j,n)=1, 1 <= j <= n.
A000010(n) / a(n) is another multiplicative integer sequence (size of the kernel of the isomorphism of the multiplicative group modulo n to the multiplicative group of 7th powers modulo n).
|
|
LINKS
|
|
|
FORMULA
|
Conjecture: a(2^e) = 1 for e <= 1; a(2^e) = 2^(e-1) for e >= 1; a(7^e) = 6 for e=1; a(7^e) = 6*7^(e-2) for e >= 2; a(p^e) = (p-1)*p^(e-1) for p == {2,3,4,5,6} (mod 7); a(p^e) = (p-1)*p^(e-1)/7 for p == 1 (mod 7). - R. J. Mathar, Oct 13 2017
|
|
MAPLE
|
local r, j;
r := {} ;
for j from 1 to n do
if igcd(j, n)= 1 then
r := r union { modp(j &^ 7, n) } ;
end if;
end do:
nops(r) ;
end proc:
|
|
MATHEMATICA
|
a[n_] := EulerPhi[n]/Count[Range[0, n - 1]^7 - 1, k_ /; Divisible[k, n]];
f[p_, e_] := (p-1)*p^(e-1)/If[Mod[p, 7] == 1, 7, 1]; f[2, e_] := 2^(e-1); f[7, 1] = 6; f[7, e_] := 6*7^(e-2); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Aug 10 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|