OFFSET
1,1
COMMENTS
Start is similar to A194125; first terms here but missing there are 140, 212, 236.
REFERENCES
S. W. Golomb, "Shift Register Sequences", revised edition, reprinted by Aegean Park Press, 1982. See Tables V-1, V-2.
LINKS
Joerg Arndt, Complete list of primitive trinomials over GF(2) up to degree 400 [Cached copy, with permission]
A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996; see Table 4.8.
MAPLE
A073726 := proc(n) local k, m: option remember: if(n=1)then return 2: else m:=procname(n-1)+1: while(true)do for k from 1 to m-1 do if Primitive(x^m+x^k+1) mod 2 then return m: fi: od: m:=m+1: od: fi: end:
seq(A073726(n), n=1..20); # Nathaniel Johnston, Apr 26 2011
MATHEMATICA
okQ[n_] := AnyTrue[Range[n-1], PrimitivePolynomialQ[x^n + x^# + 1, 2]&];
Select[Range[201], okQ] (* Jean-François Alcover, Aug 19 2019 *)
PROG
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
Richard P. Brent and Paul Zimmermann, Sep 05 2002
EXTENSIONS
a(49)-a(58) from Nathaniel Johnston, Apr 26 2011
STATUS
approved