1,2

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.

Table of n, a(n) for n=1..60.

Joerg Arndt, Matters Computational (The Fxtbook), section 42.9 "Gaussian normal bases", pp.914-920

Cf. A136415.

Sequence in context: A276579 A166158 A289997 * A246867 A028805 A322846

Adjacent sequences: A137310 A137311 A137312 * A137314 A137315 A137316

nonn

Joerg Arndt, Apr 05 2008

approved