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.

A066501 Numbers k such that x^6 == 1 (mod(k)) has no solution 1 < x < k-1.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 10, 11, 17, 22, 23, 25, 29, 34, 41, 46, 47, 50, 53, 58, 59, 71, 82, 83, 89, 94, 101, 106, 107, 113, 118, 121, 125, 131, 137, 142, 149, 166, 167, 173, 178, 179, 191, 197, 202, 214, 226, 227, 233, 239, 242, 250, 251, 257, 262, 263, 269, 274, 281, 289, 293
Offset: 1

Views

Author

Benoit Cloitre, Jan 04 2002

Keywords

Crossrefs

Programs

  • PARI
    isok(n) = {for (x=2, n-2, if ((Mod(x, n)^6) == Mod(1, n), return (0));); return (1);} \\ Michel Marcus, Nov 20 2013

Formula

Sequence consists of the numbers 4, 6 and for all k > 1, A045309(k), 2*A045309(k), A045309(k)^2, 2*A045309(k)^2.

Extensions

Extended by Ray Chandler, Nov 06 2003
Terms 1, 2 and 3 prepended by Michel Marcus, Nov 20 2013