login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A336655
Odd numbers k such that the multiplicative order of 2 modulo k is squarefree.
3
1, 3, 7, 9, 11, 21, 23, 31, 33, 43, 47, 49, 59, 63, 67, 69, 71, 77, 79, 83, 89, 93, 99, 103, 107, 121, 127, 129, 131, 139, 141, 147, 151, 161, 167, 177, 179, 191, 201, 207, 211, 213, 217, 223, 227, 231, 233, 237, 239, 249, 253, 263, 267, 279, 281, 283, 301, 307
OFFSET
1,2
LINKS
Francesco Pappalardi, Square free values of the order function, New York J. Math., Vol. 9 (2003), pp. 331-344.
FORMULA
The number of terms not exceeding x is (a + o(1))* x * log(x)^(b-1), where a and b (~ 0.46437) are constants (Pappalardi, 2003).
EXAMPLE
3 is a term since the multiplicative order of 2 modulo 3 is 2 which is squarefree.
MATHEMATICA
Select[2 * Range[160] - 1, SquareFreeQ[MultiplicativeOrder[2, #]] &]
PROG
(PARI) isok(k) = (k % 2) && issquarefree(znorder(Mod(2, k))); \\ Michel Marcus, Jul 29 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Jul 28 2020
STATUS
approved