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.

A101284 Numbers n such that a type-8 Gaussian normal basis exists for GF(2^n) over GF(2).

Original entry on oeis.org

5, 9, 11, 17, 29, 35, 39, 51, 65, 71, 77, 95, 101, 107, 117, 129, 131, 137, 141, 149, 161, 179, 185, 201, 215, 239, 249, 267, 269, 287, 297, 299, 305, 309, 315, 327, 329, 339, 341, 347, 371, 375, 381, 401, 407, 429, 431, 441, 449, 459, 471, 479
Offset: 1

Views

Author

Joerg Arndt, Apr 09 2008

Keywords

Comments

A type-t Gaussian normal basis exists for GF(2^n) if p=n*t+1 is prime and gcd(n,(p-1)/ord(2 mod p))==1.

Crossrefs

Cf. A136415.

Programs

  • PARI
    isok(n) = (isprime(p=8*n+1) && gcd(n, (p-1)/znorder(Mod(2, p))) == 1); \\ Michel Marcus, Aug 18 2013