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.

A059006 Numbers k such that x^k + x^2 + 1 is irreducible over GF(7).

Original entry on oeis.org

2, 3, 6, 9, 18, 65, 66, 287, 354, 1425, 3743, 5598
Offset: 1

Views

Author

Robert G. Wilson v, Jan 16 2001

Keywords

Comments

No terms == 1 (mod 3), as e.g. 2^k + 2^2 + 1 == 0 mod 7 when k == 1 (mod 3). - Robert Israel, Dec 22 2024

Crossrefs

Programs

  • Maple
    R:= NULL:
    for k from 1 to 10000 do
     if Irreduc(x^k + x^2 + 1) mod 7 then R:= R, k fi
    od:
    R; # Robert Israel, Dec 22 2024

Extensions

2 inserted and more terms from Robert Israel, Dec 22 2024