login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A101284
Numbers n such that a type-8 Gaussian normal basis exists for GF(2^n) over GF(2).
0
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,1
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.
PROG
(PARI) isok(n) = (isprime(p=8*n+1) && gcd(n, (p-1)/znorder(Mod(2, p))) == 1); \\ Michel Marcus, Aug 18 2013
CROSSREFS
Cf. A136415.
Sequence in context: A314602 A314603 A214604 * A362156 A102182 A100141
KEYWORD
nonn
AUTHOR
Joerg Arndt, Apr 09 2008
STATUS
approved