The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098732 Consider the sequence {b(n), n >= 1} of digits of the integers: 0 1 2 3 4 5 6 7 8 9 1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0... (A033307); a(n) = n - b(n). 2
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 12, 12, 13, 14, 14, 16, 15, 18, 16, 20, 17, 22, 18, 24, 19, 26, 20, 28, 21, 29, 32, 31, 33, 33, 34, 35, 35, 37, 36, 39, 37, 41, 38, 43, 39, 45, 40, 47, 41, 48, 52, 50, 53, 52, 54, 54, 55, 56, 56, 58, 57, 60, 58, 62, 59, 64, 60, 66, 61, 67, 72, 69 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,11 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA First[#]-Last[#]&/@Module[{ch=Flatten[IntegerDigits/@Range[ 0, 50]]}, Thread[ {Range[Length[ch]], ch}]] (* Harvey P. Dale, Oct 15 2014 *) CROSSREFS Cf. A098727, etc. Sequence in context: A308781 A317180 A187285 * A301860 A109394 A285687 Adjacent sequences: A098729 A098730 A098731 * A098733 A098734 A098735 KEYWORD base,easy,nonn AUTHOR Alexandre Wajnberg, Sep 30 2004 EXTENSIONS More terms from Joshua Zucker, May 18 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 12:57 EST 2023. Contains 367690 sequences. (Running on oeis4.)