login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 04:54 EDT 2020. Contains 337295 sequences. (Running on oeis4.)