|
%I #14 Mar 25 2015 02:00:36
%S 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,
%T 37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,
%U 60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76
%N 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).
%C Equivalently, add to n the repunit A002275(d) with same number of digits d as n.
%C See A048379 for the variant without carry, i.e., (cyclic) increase of each digit modulo 10, 0 -> 1 -> ... -> 9 -> 0.
%F a(n) = n + A002275(A055642(n)).
%F a(n) = A048379(n) if n has no digit '9'.
%e a(9) = 9 + 1 = 10, a(10) = 10 + 11 = 21, ..., a(99) = 99 + 11 = 110, a(100) = 100 + 111 = 211, ...
%o (PARI) a(n)=n+10^#Str(n)\9
%K nonn,easy,base
%O 0,2
%A _M. F. Hasler_, Mar 21 2015
|
