|
%I #7 Mar 30 2012 17:38:11
%S 1,2,2,3,3,5,2,7,4,2,2,2,2,2,2,2,2,2,2,6,2,6,2,6,2,7,2,7,2,4,4,4,4,4,
%T 4,4,4,4,4,13,4,13,4,13,4,14,4,14,4,26,2,2,4,4,28,6,6,8,8,22,6,22,6,
%U 22,6,23,6,23,6,12,12,12,12,12,12,12,12,12,12,29,8,29,8,29,8,30,8,30,8,16,16
%N Number of distinct numbers i in the range 1 <= i <= n such that there is a number j in the range 1 <= j <= n for which the carryless product i*j equals n.
%C Counted without multiplicity.
%H <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>
%Y Cf. A000005, A169891-A169899.
%K nonn,base
%O 1,2
%A _David Applegate_, _Marc LeBrun_ and _N. J. A. Sloane_, Jul 11 2010
|
