A169897 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.

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, 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, 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

Offset

1,2

Comments

Counted without multiplicity.

Links

Table of n, a(n) for n=1..91.

Index entries for sequences related to carryless arithmetic

Crossrefs

Cf. A000005, A169891-A169899.

Sequence in context: A113773 A060749 A138305 * A254309 A079375 A069933

Adjacent sequences: A169894 A169895 A169896 * A169898 A169899 A169900

Keyword

nonn,base

Author

David Applegate, Marc LeBrun and N. J. A. Sloane, Jul 11 2010

Status

approved