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”).

A083891
Number of divisors of n with largest digit = 4 (base 10).
12
0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 2, 1, 2, 1, 2, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 2, 0, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0
OFFSET
1,24
LINKS
FORMULA
a(n) = A000005(n) - A083888(n) - A083889(n) - A083890(n) - A083892(n) - A083893(n) - A083894(n) - A083895(n) - A083896(n) = A083899(n) - A083898(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} 1/A277966(k) = 0.98827280431174433126... . - Amiram Eldar, Jan 04 2024
EXAMPLE
n=120, 3 of the 16 divisors of 120 have largest digit=4: {4,24,40}, therefore a(120)=3.
MAPLE
ld4:= n -> max(convert(n, base, 10)) = 4:
f:= n -> nops(select(ld4, numtheory:-divisors(n))):
map(f, [$1..100]); # Robert Israel, May 02 2019
MATHEMATICA
Table[Count[Divisors[n], _?(Max[IntegerDigits[#]]==4&)], {n, 110}] (* Harvey P. Dale, Feb 19 2016 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, May 08 2003
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy