|
|
A333992
|
|
a(n) is the multiplicative order of the n-th prime number q modulo (q-1)#.
|
|
0
|
|
|
1, 1, 2, 4, 6, 20, 60, 120, 144, 7920, 18480, 18480, 7920, 27720, 2520, 637560, 8288280, 480720240, 240360120, 480720240, 480720240, 480720240, 240360120, 9854764920, 19709529840, 9854764920, 16424608200, 670124014560, 88791431929200, 88791431929200
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 2, q = prime(2) = 3, we have (q-1)#=2, then the multiplicative order of q modulo (q-1)# is 1.
|
|
MAPLE
|
with(NumberTheory):
primorial := proc(n::integer)
local total := 1:
local count := 2;
for count from 2 to n do
if isprime(count) then
total *= count
endif;
end:
return total;
end proc:
numberOfTerms := 3;
List := [seq(MultiplicativeOrder(ithprime(i), primorial(ithprime[i]-1)), i=1..numberOfTerms)]
|
|
MATHEMATICA
|
a[n_] := MultiplicativeOrder[Prime[n], Times @@ Prime[Range[n-1]]];
|
|
PROG
|
(PARI) a(n)={znorder(Mod(prime(n), vecprod(primes(n-1))))} \\ Andrew Howroyd, Sep 05 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|