login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A083900
Number of divisors of n with largest digit <= 5 (base 10).
4
1, 2, 2, 3, 2, 3, 1, 3, 2, 4, 2, 5, 2, 3, 4, 3, 1, 3, 1, 6, 3, 4, 2, 6, 3, 3, 2, 4, 1, 7, 2, 4, 4, 3, 3, 5, 1, 2, 3, 7, 2, 6, 2, 6, 5, 3, 1, 6, 1, 6, 3, 5, 2, 4, 4, 4, 2, 2, 1, 10, 1, 3, 3, 4, 3, 6, 1, 4, 3, 6, 1, 6, 1, 2, 5, 3, 2, 4, 1, 7, 2, 3, 1, 8, 2, 3, 2, 6, 1, 8, 2, 4, 3, 2, 2, 7, 1, 3, 4, 9, 2, 6, 2, 6, 7
OFFSET
1,2
FORMULA
a(n) = A083899(n) + A083892(n) = A083901(n) - A083893(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} 1/A007092(k) = 5.25448032967060504709... . - Amiram Eldar, Jan 04 2024
MATHEMATICA
Table[Count[Divisors[n], _?(Max[IntegerDigits[#]]<6&)], {n, 110}] (* Harvey P. Dale, Feb 02 2015 *)
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, May 08 2003
STATUS
approved