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

A139384
The number of 3-digit multiples of n whose digits sum to n.
2
1, 2, 6, 3, 5, 12, 4, 5, 45, 9, 8, 17, 5, 5, 13, 4, 4, 25, 1, 0, 4, 0, 0, 1, 0, 0, 1
OFFSET
1,2
EXAMPLE
a(1)=1 as 100 is the only 3-digit multiple of 1 whose digits sum to 1, while a(19)=1 as 874 is the only 3-digit multiple of 19 with the property.
MATHEMATICA
dm3[n_]:=Module[{min=n*Ceiling[100/n], max=n*Floor[999/n]}, Length[ Select[Range[min, max, n], Total[IntegerDigits[#]]==n&]]]; Array[dm3, 30] (* Harvey P. Dale, Dec 18 2011 *)
CROSSREFS
Sequence in context: A163338 A323335 A338444 * A083481 A177209 A274439
KEYWORD
base,full,nonn,fini
AUTHOR
Ian Duff, Jun 08 2008
STATUS
approved