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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083898 Number of divisors of n with largest digit <= 3 (base 10). 5
 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 4, 2, 2, 2, 2, 1, 3, 1, 4, 3, 4, 2, 4, 1, 3, 2, 2, 1, 5, 2, 3, 4, 2, 1, 4, 1, 2, 3, 4, 1, 4, 1, 4, 2, 3, 1, 4, 1, 3, 2, 3, 1, 3, 2, 2, 2, 2, 1, 7, 1, 3, 3, 3, 2, 6, 1, 2, 3, 3, 1, 4, 1, 2, 2, 2, 2, 4, 1, 4, 2, 2, 1, 5, 1, 2, 2, 4, 1, 5, 2, 3, 3, 2, 1, 5, 1, 2, 4, 5, 2, 4, 2, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = A083897(n) + A083890(n) = A083899(n) - A083891(n). LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA Table[Count[Divisors[n], _?(Total[Most[Drop[DigitCount[#], 3]]]==0&)], {n, 120}] (* Harvey P. Dale, Dec 21 2018 *) CROSSREFS Cf. A054055, A000005. Sequence in context: A106253 A078720 A270488 * A078314 A330894 A068322 Adjacent sequences:  A083895 A083896 A083897 * A083899 A083900 A083901 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 21 10:28 EDT 2021. Contains 343149 sequences. (Running on oeis4.)