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!)
 A242799 Numbers n such that A = n + digitsum(n) is divisible by the highest power of 10 <= A. 0
 1, 2, 3, 4, 5, 24, 29, 43, 48, 62, 67, 81, 86, 190, 285, 484, 579, 683, 778, 882, 977, 1981, 2976, 3980, 4975, 6974, 7969, 8973, 9968, 19972, 29967, 39971, 49966, 59970, 69965, 89964, 99959, 199963, 299958, 399962, 499957, 599961, 699956, 799960, 899955, 1999954, 2999949 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE 48 + (4 + 8) = 60 is divisible by the highest power of 10 less than 60 (10^1). So 48 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: A080695 A239448 A248713 * A281588 A088865 A237342 Adjacent sequences:  A242796 A242797 A242798 * A242800 A242801 A242802 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 March 28 15:09 EDT 2020. Contains 333089 sequences. (Running on oeis4.)