|
%I #12 Mar 31 2017 20:49:06
%S 0,1,1,1,1,1,1,1,1,1,10,11,11,11,11,11,11,11,11,11,10,11,11,11,11,11,
%T 11,11,11,11,10,11,11,11,11,11,11,11,11,11,10,11,11,11,11,11,11,11,11,
%U 11,10,11,11,11,11,11,11,11,11,11,10,11,11,11,11,11,11,11,11,11,10,11,11
%N Replace all digits greater than 1 with 1 (in decimal representation).
%C A054055(a(n)) <= 1; A064770(a(n)) = a(n).
%H R. Zumkeller, <a href="/A136400/b136400.txt">Table of n, a(n) for n = 0..9999</a>
%F a(n) = A064770(A064770(n)).
%t Table[FromDigits[If[#>1,1,#]&/@IntegerDigits[n]],{n,0,120}] (* _Harvey P. Dale_, Jul 24 2016 *)
%o (PARI) a(n)=subst(Pol(apply(k->min(k,1), digits(n))),'x,10) \\ _Charles R Greathouse IV_, Jul 31 2013
%o (Haskell)
%o a136400 0 = 0
%o a136400 n = a136400 n' * 10 + min 1 d where (n',d) = divMod n 10
%o -- _Reinhard Zumkeller_, Aug 05 2013
%K nonn,base,easy
%O 0,11
%A _Reinhard Zumkeller_, Dec 30 2007
|
