login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069035 Smallest proper multiple of n with digit sum n. 4

%I #40 Feb 15 2021 23:00:56

%S 10,20,12,40,50,24,70,80,18,190,209,48,247,266,195,448,476,198,874,

%T 3980,399,2398,1679,888,4975,1898,999,7588,4988,39990,8959,17888,

%U 42999,28798,57995,29988,37999,59888,49998,699880,177899,88998,99889,479996

%N Smallest proper multiple of n with digit sum n.

%H David A. Corneth, <a href="/A069035/b069035.txt">Table of n, a(n) for n = 1..274</a>

%t ssm[n_]:=Module[{k=2},While[Total[IntegerDigits[k*n]]!=n,k++];k*n]; Array[ ssm,50] (* _Harvey P. Dale_, Nov 24 2012 *)

%o (PARI) a(n) = {my(m=2*n); while (sumdigits(m) != n, m+=n); m;} \\ _Michel Marcus_, Feb 24 2016

%Y Cf. A002998, A007953.

%K nonn,base

%O 1,1

%A _Amarnath Murthy_, Apr 02 2002

%E Offset corrected by _Harvey P. Dale_, Nov 24 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:12 EDT 2024. Contains 371969 sequences. (Running on oeis4.)