|
%I #26 Nov 08 2022 11:23:01
%S 0,1,0,1,0,1,0,1,0,1,10,11,10,11,10,11,10,11,10,11,0,1,0,1,0,1,0,1,0,
%T 1,10,11,10,11,10,11,10,11,10,11,0,1,0,1,0,1,0,1,0,1,10,11,10,11,10,
%U 11,10,11,10,11,0,1,0,1,0,1,0,1,0,1,10,11,10,11,10,11,10,11,10,11,0,1,0,1,0,1
%N In decimal representation of n: replace all even digits with 0 and all odd digits with 1.
%H Reinhard Zumkeller, <a href="/A103181/b103181.txt">Table of n, a(n) for n = 0..9999</a>
%F n = Sum(d(k)*10^k: 0<=d(k)<10) -> a(n) = Sum((d(k) mod 2)*10^k).
%F a(A014263(n)) = 0. - _Reinhard Zumkeller_, Oct 04 2011
%e 199->'111': a(199)=111; 200->'000': a(200)=0;
%e 299->'011': a(299)=11; 300->'100': a(300)=100.
%t Table[FromDigits[If[EvenQ[#],0,1]&/@IntegerDigits[n]],{n,0,90}] (* _Harvey P. Dale_, Nov 08 2022 *)
%o (Haskell)
%o import Data.List (unfoldr); import Data.Tuple (swap)
%o a103181_list = map a103181 [0..]
%o a103181 n = foldl f 0 $ reverse $ unfoldr g n where
%o f v d = 10 * v + mod d 2
%o g x = if x == 0 then Nothing else Just $ swap $ divMod x 10
%o -- _Reinhard Zumkeller_, Oct 04 2011
%o (PARI) a(n)=subst(Pol(apply(k->k%2, digits(n))),'x,10) \\ _Charles R Greathouse IV_, Jul 16 2013
%o (Python)
%o def A103181(n): return int(''.join(str(int(d) % 2) for d in str(n))) # _Chai Wah Wu_, Apr 09 2022
%Y Cf. A000035, A014263.
%K nonn,base,easy
%O 0,11
%A _Reinhard Zumkeller_, Mar 18 2005
|
