%I #5 Mar 31 2012 13:21:10
%S 0,0,0,0,0,0,1,0,0,0,1,0,1,1,0,0,0,0,1,0,1,1,2,0,1,1,1,1,2,0,2,0,0,0,
%T 1,0,1,1,1,0,1,1,1,1,0,2,2,0,1,1,0,1,1,1,4,1,1,2,3,0,3,2,3,0,0,0,1,0,
%U 1,1,2,0,1,1,2,1,2,1,3,0,1,1,2,1,1,1,2,1,2,0,4,2,2,2,2,0,1,1,4,1,2,0
%N Number of distinct m's < n, such that there exists nonzero solutions to a cross-domain congruence m*i = n X i.
%H <a href="/index/Con#CongruCrossDomain">Index entries for sequences defined by congruent products between domains N and GF(2)[X]</a>
%Y a(2n) = a(n). Cf. A115859, A115869, A115871.
%K nonn
%O 1,23
%A _Antti Karttunen_, Feb 07 2006