login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083892 Number of divisors of n with largest digit = 5 (base 10). 11
0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 0, 0, 0, 0, 3, 1, 1, 1, 1, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 3, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 0, 1, 0, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,15

COMMENTS

a(n) = A000005(n) - A083888(n) - A083889(n) - A083890(n) - A083891(n) - A083893(n) - A083894(n) - A083895(n) - A083896(n) = A083900(n) - A083899(n).

LINKS

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

EXAMPLE

n=125, 3 of the 4 divisors of 125 have largest digit =5:

{5,25,125}, therefore a(125)=3.

MATHEMATICA

Table[Count[Divisors[n], _?(Max[IntegerDigits[#]]==5&)], {n, 110}] (* Harvey P. Dale, Aug 08 2015 *)

CROSSREFS

Cf. A054055, A000005, A083900.

Sequence in context: A112765 A105966 A083915 * A089814 A063100 A294266

Adjacent sequences:  A083889 A083890 A083891 * A083893 A083894 A083895

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 07:57 EDT 2018. Contains 316276 sequences. (Running on oeis4.)