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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055120 Digital complement of n (replace each nonzero digit d with 10-d). 17

%I #61 Jan 16 2023 11:17:26

%S 0,9,8,7,6,5,4,3,2,1,90,99,98,97,96,95,94,93,92,91,80,89,88,87,86,85,

%T 84,83,82,81,70,79,78,77,76,75,74,73,72,71,60,69,68,67,66,65,64,63,62,

%U 61,50,59,58,57,56,55,54,53,52,51,40,49,48,47,46,45,44,43,42,41,30,39

%N Digital complement of n (replace each nonzero digit d with 10-d).

%C a(n) = -n in carryless arithmetic mod 10 - that is, n + a(n) = 0 (cf. A169894). - _N. J. A. Sloane_, Aug 03 2010

%H N. J. A. Sloane, <a href="/A055120/b055120.txt">Table of n, a(n) for n = 0..10000</a>

%H David Applegate, Marc LeBrun and N. J. A. Sloane, <a href="http://neilsloane.com/doc/carry1.pdf">Carryless Arithmetic (I): The Mod 10 Version</a>.

%H <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%F From _Robert Israel_, Sep 04 2017: (Start)

%F a(10*n) = 10*a(n).

%F a(10*n+j) = 10*a(n) + 10 - j for 1 <= j <= 9.

%F G.f. g(x) satisfies g(x) = 10*(1+x+x^2+...+x^9)*g(x^10) + (9*x+8*x^2+7*x^3+6*x^4+5*x^5+4*x^6+3*x^7+2*x^8+x^9)/(1-x^10).

%F (End)

%e a(11) = 99 because 1 + 9 = 0 mod 10 for each digit.

%e a(20) = 80 because 2 + 8 = 0 mod 10 and 0 + 0 = 0 mod 10.

%p f:=proc(n) local t0,t1,i;

%p t0:=0; t1:=convert(n,base,10);

%p for i from 1 to nops(t1) do

%p if t1[i]>0 then t0:=t0+(10-t1[i])*10^(i-1); fi;

%p od:

%p RETURN(t0);

%p end;

%p # _N. J. A. Sloane_, Jan 21 2011

%t a[n_] := FromDigits[ IntegerDigits[n] /. d_?Positive -> 10-d]; Table[a[n], {n, 0, 100}](* _Jean-François Alcover_, Nov 28 2011 *)

%o (Haskell)

%o a055120 = foldl f 0 . reverse . unfoldr g where

%o f v d = if d == 0 then 10 * v else 10 * v + 10 - d

%o g x = if x == 0 then Nothing else Just $ swap $ divMod x 10

%o -- _Reinhard Zumkeller_, Oct 04 2011

%o (PARI) a(n)=fromdigits(apply(d->if(d,10-d,0),digits(n))) \\ _Charles R Greathouse IV_, Feb 08 2017

%o (Python)

%o def A055120(n): return int(''.join(str(10-int(d)) if d != '0' else d for d in str(n))) # _Chai Wah Wu_, Apr 03 2021

%Y Cf. A004488, A048647, A055115-A055126, A061601.

%Y Column k=10 of A248813.

%K base,easy,nice,nonn

%O 0,2

%A _Henry Bottomley_, Apr 19 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 1 14:13 EDT 2024. Contains 375591 sequences. (Running on oeis4.)