The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A336656 Numbers k not divisible by 3 such that the multiplicative order of 3 modulo k is squarefree. 3
 1, 2, 4, 7, 8, 11, 13, 14, 22, 23, 26, 28, 31, 43, 44, 46, 47, 49, 52, 56, 59, 61, 62, 67, 71, 77, 79, 83, 86, 88, 91, 92, 94, 98, 103, 104, 107, 118, 121, 122, 124, 131, 134, 139, 142, 143, 154, 157, 158, 161, 166, 167, 169, 172, 179, 182, 184, 188, 191, 196 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 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.51175) are constants (Pappalardi, 2003). EXAMPLE 2 is a term since the multiplicative order of 3 modulo 2 is 1 which is squarefree. MATHEMATICA Select[Range[200], !Divisible[#, 3] && SquareFreeQ[MultiplicativeOrder[3, #]] &] PROG (PARI) isok(k) = (k % 3) && issquarefree(znorder(Mod(3, k))); \\ Michel Marcus, Jul 29 2020 CROSSREFS Cf. A007734, A005117, A049149, A336654, A336655. Sequence in context: A093696 A190851 A325427 * A243751 A187838 A106265 Adjacent sequences:  A336653 A336654 A336655 * A336657 A336658 A336659 KEYWORD nonn AUTHOR Amiram Eldar, Jul 28 2020 STATUS approved

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

Last modified June 19 15:03 EDT 2021. Contains 345141 sequences. (Running on oeis4.)