login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #13 Apr 20 2016 00:26:05

%S 0,0,0,1,0,1,0,9,2,19,6,76,0,157,113,1031,0,2506,0,13321,4204,35246,

%T 3924,158464,21623,430391,283774,1854971,52648,5553234,0,33556537,

%U 18428119,83562231,18807137,436801680,8328278,1205614037

%N Number of irreducible normal polynomials of degree n over GF(2) that are not primitive.

%H Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>, section 42.6.3 "The number of binary normal bases", pp. 904-907.

%H Joerg Arndt, <a href="http://jjj.de/fxt/demo/gf2n/#all-normalpoly">C++ program used for computing this sequence</a>

%F a(n) = A027362(n) - A107222(n).

%F a(n) = 0 if 2^n - 1 is prime.

%Y Cf. A027362 (primitive normal polynomials), A107222.

%K nonn

%O 1,8

%A _Joerg Arndt_, Apr 18 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)