Thanks to everyone who made a donation during our annual appeal! To see the list of donors, or make a donation, see the OEIS Foundation home page.
1,1
Or, primitive irreducible polynomials over GF(2) listed in lexicographic order and evaluated at X=2.
T. D. Noe, Table of n, a(n) for n=1..1110 (through degree 13)
A. Karttunen, Scheme-program for computing this sequence.
Index entries for sequences operating on GF(2)[X]-polynomials
a(n) = A014580(A091249(n)). Cf. A011260, A091252. A007088(a(n)) = A058947(n) (same sequence in binary).
Sequence in context: A070303 A256863 A136087 * A186645 A077256 A067542
Adjacent sequences: A091247 A091248 A091249 * A091251 A091252 A091253
nonn
Antti Karttunen, Jan 03 2004
approved