This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A256079 Increase each (decimal) digit of n by 1, with carry (i.e., '9' becomes '0' and a (further) increment of 1 of the digit to the left). 2
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Equivalently, add to n the repunit A002275(d) with same number of digits d as n. See A048379 for the variant without carry, i.e., (cyclic) increase of each digit modulo 10, 0 -> 1 -> ... -> 9 -> 0. LINKS FORMULA a(n) = n + A002275(A055642(n)). a(n) = A048379(n) if n has no digit '9'. EXAMPLE a(9) = 9 + 1 = 10, a(10) = 10 + 11 = 21, ..., a(99) = 99 + 11 = 110, a(100) = 100 + 111 = 211, ... PROG (PARI) a(n)=n+10^#Str(n)\9 CROSSREFS Sequence in context: A248651 A306361 A068861 * A216556 A068860 A158699 Adjacent sequences:  A256076 A256077 A256078 * A256080 A256081 A256082 KEYWORD nonn,easy,base AUTHOR M. F. Hasler, Mar 21 2015 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 September 15 12:22 EDT 2019. Contains 327078 sequences. (Running on oeis4.)