cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A336654 Numbers k such that lambda(k) is squarefree, where lambda is the Carmichael lambda function (A002322).

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 18, 21, 22, 23, 24, 28, 31, 33, 36, 42, 43, 44, 46, 47, 49, 56, 59, 62, 63, 66, 67, 69, 71, 72, 77, 79, 83, 84, 86, 88, 92, 93, 94, 98, 99, 103, 107, 118, 121, 124, 126, 129, 131, 132, 134, 138, 139, 141, 142, 147, 154, 158, 161
Offset: 1

Views

Author

Amiram Eldar, Jul 28 2020

Keywords

Examples

			6 is a term since lambda(6) = 2 is squarefree.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[160], SquareFreeQ[CarmichaelLambda[#]] &]

Formula

The number of terms not exceeding x is (k + o(1)) * x/(log(x)^(1-a)), where a = 0.373955... is Artin's constant (A005596), and k = 0.80328... is another constant (Pappalardi et al., 2003).

A336655 Odd numbers k such that the multiplicative order of 2 modulo k is squarefree.

Original entry on oeis.org

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

Views

Author

Amiram Eldar, Jul 28 2020

Keywords

Examples

			3 is a term since the multiplicative order of 2 modulo 3 is 2 which is squarefree.
		

Crossrefs

Programs

  • Mathematica
    Select[2 * Range[160] - 1, SquareFreeQ[MultiplicativeOrder[2, #]] &]
  • PARI
    isok(k) = (k % 2) && issquarefree(znorder(Mod(2,k))); \\ Michel Marcus, Jul 29 2020

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).
Showing 1-2 of 2 results.