Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Mar 31 2012 14:02:20
%S 0,0,0,1,1,3,4,8,13,26,45,83,152,281,523,974,1822,3451,6490,12348,
%T 23389,44598,85076,162735,311721,598669,1150613,2215562,4271844,
%U 8247356,15941844,30849114,59758104,115878009,224900328
%N How many more primes than irreducible GF(2)[X] polynomials there are in range [0,2^n].
%H A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a>
%H <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a>
%F a(0)=a(1)=0, a(n) = A007053(n)-A062692(n-1).
%e There are 11 primes (2,3,5,7,11,13,17,19,23,29,31) in range [0,32], while there are only 8 irreducible GF(2)[X]-polynomials in the same range: (2,3,7,11,13,19,25,31), thus a(5)=3.
%Y Partial sums of A091232.
%K nonn
%O 0,6
%A _Antti Karttunen_, Jan 03 2004