%I #6 Mar 31 2012 13:21:10
%S 1,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,2,2,3,1,2,
%U 1,3,2,3,1,2,2,2,2,3,2,2,1,2,3,2,2,3,1,2,2,3,1,3,2,2,2,2,1,3,2,2,3,2
%N Number of leaves in GF(2)[X] superfactorization of n.
%H A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a>
%F a(n) = A106494(n)-A106493(n).
%Y a(n) = A064372(A106445(n)). After n=1 differs from A091221 for the first time at n=64, where A091221(64)=1, while a(64)=2.
%K nonn
%O 1,6
%A _Antti Karttunen_, May 09 2005