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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069534 Smallest multiple of 5 with digit sum n. 15
10, 20, 30, 40, 5, 15, 25, 35, 45, 55, 65, 75, 85, 95, 195, 295, 395, 495, 595, 695, 795, 895, 995, 1995, 2995, 3995, 4995, 5995, 6995, 7995, 8995, 9995, 19995, 29995, 39995, 49995, 59995, 69995, 79995, 89995, 99995, 199995, 299995, 399995, 499995, 599995 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(6) onwards the pattern is evident.

LINKS

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

FORMULA

a(n) = ((n+4)%9+1)*10^floor((n+4)/9)-5 for all n > 4, where % is the binary mod/remainder operator. - M. F. Hasler, Sep 16 2016

MATHEMATICA

t={}; Do[i=5; While[Total[IntegerDigits[i]]!=n, i=i+5]; AppendTo[t, i], {n, 46}]; t (* Jayanta Basu, May 19 2013 *)

With[{f=5*Range[200000]}, Flatten[Table[Select[f, Total[IntegerDigits[#]] == n&, 1], {n, 50}]]] (* Harvey P. Dale, Dec 31 2013 *)

PROG

(PARI) A069534(n)=(((n+4)%9+1)*10^((n+4)\9)-5)*10^(n<5) \\ M. F. Hasler, Sep 16 2016

CROSSREFS

Cf. A069521 to A069530, A069532, A069533.

Sequence in context: A157938 A095208 A172260 * A237416 A236507 A031140

Adjacent sequences:  A069531 A069532 A069533 * A069535 A069536 A069537

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Apr 01 2002

EXTENSIONS

More terms from Ray Chandler, Jul 28 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 March 29 18:39 EDT 2017. Contains 284273 sequences.