OFFSET
1,3
COMMENTS
All terms are even for n>=3.
FORMULA
From Ridouane Oudra, May 23 2026: (Start)
If n is in A033948 then:
a(n) = Product_{d|lambda(n)} d^phi(d), or also: a(n) = Product_{d|phi(n)} d^phi(d).
In particular, a(p) = Product_{d|(p-1)} d^phi(d), for p prime. (End)
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
KEYWORD
nonn
AUTHOR
Darío Clavijo, Apr 25 2024
STATUS
approved
