%I #12 Oct 11 2024 13:10:10
%S 0,1,1,1,1,2,1,1,2,2,1,2,1,2,1,1,1,3,1,2,1,2,2,2,1,2,2,2,2,2,1,1,2,2,
%T 2,3,1,2,2,2,1,2,2,2,2,3,1,2,2,2,1,2,2,3,1,2,2,3,1,2,1,2,2,1,2,3,1,2,
%U 1,3,2,3,1,2,2,2,2,3,2,2,1,2,3,2,1,3,1,2,2,3,1,3,2,2,2,2,1,3,2,2,3,2
%N Number of distinct irreducible polynomials dividing n-th GF(2)[X]-polynomial.
%H Robert Israel, <a href="/A091221/b091221.txt">Table of n, a(n) for n = 1..10000</a>
%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>
%p f:= proc(n) local L,P,R,i;
%p L:= convert(n,base,2);
%p P:= add(L[i]*X^(i-1),i=1..nops(L));
%p R:= Factors(P) mod 2;
%p nops(R[2]);
%p end proc:
%p map(f, [$1.200]); # _Robert Israel_, Oct 11 2024
%Y a(n) = A001221(A091203(n)) = A001221(A091205(n)). A000374(n) = a(A000051(n)).
%K nonn
%O 1,6
%A _Antti Karttunen_, Jan 03 2004