|
| |
|
|
A066568
|
|
a(n) = n - sum of digits of n.
|
|
2
| |
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 63, 63, 63, 63, 63, 63
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,11
|
|
|
COMMENTS
| The sum of the digits of any term of this sequence (A066568) is divisible by 9. - Alexandre Wajnberg (alexandre.wajnberg(AT)ulb.ac.be), Sep 30 2004
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
|
EXAMPLE
| a(23) = 23 -2-3 = 18, a(2345) = 2345-2-3-4-5 = 2331
|
|
|
MATHEMATICA
| Table[n-Total[IntegerDigits[n]], {n, 0, 80}] (* From Harvey P. Dale, Sep 19 2011 *)
|
|
|
PROG
| (PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { for (n=0, 1000, write("b066568.txt", n, " ", n - SumD(n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 05 2010]
|
|
|
CROSSREFS
| Cf. A060028. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 31 2010]
Sequence in context: A181693 A010734 A180599 * A106326 A088471 A087416
Adjacent sequences: A066565 A066566 A066567 * A066569 A066570 A066571
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 18 2001
|
|
|
EXTENSIONS
| More terms from Larry Reeves (larryr(AT)acm.org), Dec 21 2001
|
| |
|
|
