login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A136399
Numbers having in their decimal representation at least one digit greater than 1.
5
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, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75
OFFSET
1,1
COMMENTS
A054055(a(n)) > 1;
Complement of A007088; A064770(a(n)) <> a(n).
LINKS
MATHEMATICA
Select[Range[100], Max[IntegerDigits[#]] > 1 &] (* Paolo Xausa, Oct 30 2024 *)
PROG
(Haskell)
a136399 n = a136399_list !! (n-1)
a136399_list = filter (any (> '1') . show) [0..]
-- Reinhard Zumkeller, Apr 25 2012
(Python)
def A136399(n):
def f(x):
s = str(x)
for i in range(l:=len(s)):
if s[i]>'1':
break
else:
return n+int(s, 2)
return n+int(s[:i]+'1'*(l-i), 2)
m, k = n, f(n)
while m != k: m, k = k, f(k)
return m # Chai Wah Wu, Oct 16 2024
(Python)
def ok(n): return any(d > '1' for d in str(n))
print([k for k in range(76) if ok(k)]) # Michael S. Branicky, Oct 29 2024
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Dec 30 2007
STATUS
approved