This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A272033 Number of irreducible normal polynomials of degree n over GF(2) that are not primitive. 0
 0, 0, 0, 1, 0, 1, 0, 9, 2, 19, 6, 76, 0, 157, 113, 1031, 0, 2506, 0, 13321, 4204, 35246, 3924, 158464, 21623, 430391, 283774, 1854971, 52648, 5553234, 0, 33556537, 18428119, 83562231, 18807137, 436801680, 8328278, 1205614037 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS Joerg Arndt, Matters Computational (The Fxtbook), section 42.6.3 "The number of binary normal bases", pp. 904-907. Joerg Arndt, C++ program used for computing this sequence FORMULA a(n) = A027362(n) - A107222(n). a(n) = 0 if 2^n - 1 is prime. CROSSREFS Cf. A027362 (primitive normal polynomials), A107222. Sequence in context: A256658 A094581 A040080 * A098289 A152020 A055516 Adjacent sequences:  A272030 A272031 A272032 * A272034 A272035 A272036 KEYWORD nonn AUTHOR Joerg Arndt, Apr 18 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 14 04:29 EDT 2019. Contains 327995 sequences. (Running on oeis4.)