login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066568 a(n) = n - sum of digits of n. 10
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; text; internal format)
OFFSET

0,11

COMMENTS

The sum of the digits of any term of this sequence (A066568) is divisible by 9. - Alexandre Wajnberg, Sep 30 2004

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..1000

Index entries for Colombian or self numbers and related sequences

EXAMPLE

a(23) = 23 - 2 - 3 = 18, a(2345) = 2345 - 2 - 3 - 4 - 5 = 2331.

MATHEMATICA

Table[n-Total[IntegerDigits[n]], {n, 0, 80}] (* 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)) ) } \\ Harry J. Smith, Mar 05 2010

(PARI) a(n) = n - sumdigits(n); \\ Michel Marcus, Jan 04 2016

(MAGMA) [n -(&+Intseq(n)): n in [1..100]]; // Vincenzo Librandi, Jan 04 2016

CROSSREFS

Cf. A060028. - Reinhard Zumkeller, Mar 31 2010

Cf. A066568.

Sequence in context: A010734 A180599 A291092 * A291514 A106326 A245400

Adjacent sequences:  A066565 A066566 A066567 * A066569 A066570 A066571

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Dec 18 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Dec 21 2001

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 05:39 EDT 2019. Contains 328146 sequences. (Running on oeis4.)