The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A242474 Numbers n such that A = n - digitsum(n) is divisible by the largest power of 10 <= A. 0
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 9010, 9011, 9012, 9013, 9104, 9015, 9016, 9017, 9018, 9019, 90010, 90011, 90012, 90013, 90014, 90015, 90016, 90017, 90018, 90019, 900010, 900011, 900012 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For n > 19, A = 9*10^k for some k. LINKS EXAMPLE 912 - (9 + 1 + 2) = 900 is divisible by the highest power of 10 less than 900 (10^2). So 912 is a member of this sequence. PROG (PARI) DS(n)={t=0; for(i=1, #digits(n), t+=digits(n)[i]); return(t)} for(n=1, 10^7, if((n-DS(n))%(10^(#Str(n-DS(n))-1))==0, print1(n, ", "))) CROSSREFS Cf. A007953. Sequence in context: A055644 A229621 A077342 * A160544 A276568 A295020 Adjacent sequences:  A242471 A242472 A242473 * A242475 A242476 A242477 KEYWORD nonn,base AUTHOR Derek Orr, May 31 2014 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 28 17:15 EDT 2021. Contains 346335 sequences. (Running on oeis4.)