OFFSET
0,2
COMMENTS
This gives the number of seeds S(2*n+1) = a(n) needed for the complete quadrupling system modulo 2*n + 1 given in A339046.
MATHEMATICA
Array[EulerPhi[#]/MultiplicativeOrder[4, #] &[2 # + 1] &, 61, 0] (* Michael De Vlieger, Dec 13 2020 *)
PROG
(PARI) a(n) = eulerphi(2*n+1)/znorder(Mod(4, 2*n+1)); \\ Michel Marcus, Dec 15 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, Dec 13 2020
STATUS
approved