%I #21 Oct 30 2024 08:39:35
%S 2,3,4,5,6,7,8,9,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,
%T 29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,
%U 52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75
%N Numbers having in their decimal representation at least one digit greater than 1.
%C A054055(a(n)) > 1;
%C Complement of A007088; A064770(a(n)) <> a(n).
%H Reinhard Zumkeller, <a href="/A136399/b136399.txt">Table of n, a(n) for n = 1..10000</a>
%t Select[Range[100], Max[IntegerDigits[#]] > 1 &] (* _Paolo Xausa_, Oct 30 2024 *)
%o (Haskell)
%o a136399 n = a136399_list !! (n-1)
%o a136399_list = filter (any (> '1') . show) [0..]
%o -- _Reinhard Zumkeller_, Apr 25 2012
%o (Python)
%o def A136399(n):
%o def f(x):
%o s = str(x)
%o for i in range(l:=len(s)):
%o if s[i]>'1':
%o break
%o else:
%o return n+int(s,2)
%o return n+int(s[:i]+'1'*(l-i),2)
%o m, k = n, f(n)
%o while m != k: m, k = k, f(k)
%o return m # _Chai Wah Wu_, Oct 16 2024
%o (Python)
%o def ok(n): return any(d > '1' for d in str(n))
%o print([k for k in range(76) if ok(k)]) # _Michael S. Branicky_, Oct 29 2024
%Y Cf. A007088, A054055, A064770.
%K nonn,base
%O 1,1
%A _Reinhard Zumkeller_, Dec 30 2007