|
|
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, 9014, 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
|
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,-10).
|
|
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
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|