cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A139384 The number of 3-digit multiples of n whose digits sum to n.

Original entry on oeis.org

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

Views

Author

Ian Duff, Jun 08 2008

Keywords

Examples

			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.
		

Programs

  • 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 *)