login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A372305 a(n) = Product_{k=2..n-1} MultiplicativeOrder(k,n) where gcd(k,n)=1. 0
1, 1, 2, 2, 32, 2, 648, 8, 648, 32, 12500000, 8, 214990848, 648, 2048, 2048, 562949953421312, 648, 11712917736940032, 2048, 3359232, 12500000, 1377791989621882898843648, 128, 5120000000000000000, 214990848, 11712917736940032 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
All terms are even for n>=3.
LINKS
MATHEMATICA
Table[Times @@ Map[MultiplicativeOrder[#, n] &, Select[Range[2, n - 1], CoprimeQ[n, #] &]], {n, 2, 27}] (* Michael De Vlieger, Apr 25 2024 *)
PROG
(Python)
from sympy import n_order, gcd, prod
a = lambda n: prod(n_order(k, n) for k in range(2, n) if gcd(k, n)==1)
print([a(n) for n in range(1, 28)])
(PARI) a(n) = prod(k=2, n-1, if (gcd(k, n)==1, znorder(Mod(k, n)), 1)); \\ Michel Marcus, Apr 26 2024
CROSSREFS
Row products of triangle A216327.
Sequence in context: A267726 A371562 A309191 * A353911 A303568 A353928
KEYWORD
nonn
AUTHOR
Darío Clavijo, Apr 25 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 28 20:03 EDT 2024. Contains 373800 sequences. (Running on oeis4.)