login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083897 Number of divisors of n with largest digit <= 2 (base 10). 3
1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 3, 1, 2, 1, 2, 1, 2, 1, 4, 2, 4, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 1, 4, 1, 3, 1, 4, 1, 2, 1, 3, 1, 3, 1, 2, 1, 2, 2, 2, 1, 2, 1, 5, 1, 2, 2, 2, 1, 4, 1, 2, 1, 3, 1, 3, 1, 2, 1, 2, 2, 2, 1, 4, 1, 2, 1, 4, 1, 2, 1, 4, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 2, 5, 2, 3, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A083888(n) + A083889(n) = A083898(n) - A083890(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} 1/A007089(k) = 2.09476944442950059256... . - Amiram Eldar, Jan 04 2024
MATHEMATICA
Table[Count[Divisors[n], _?(Max[IntegerDigits[#]]<3&)], {n, 110}] (* Harvey P. Dale, May 24 2019 *)
CROSSREFS
Sequence in context: A239061 A309025 A247599 * A368212 A025823 A025821
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, May 08 2003
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)