cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A136399 Numbers having in their decimal representation at least one digit greater than 1.

This page as a plain text file.
%I A136399 #21 Oct 30 2024 08:39:35
%S A136399 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 A136399 29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,
%U A136399 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 A136399 Numbers having in their decimal representation at least one digit greater than 1.
%C A136399 A054055(a(n)) > 1;
%C A136399 Complement of A007088; A064770(a(n)) <> a(n).
%H A136399 Reinhard Zumkeller, <a href="/A136399/b136399.txt">Table of n, a(n) for n = 1..10000</a>
%t A136399 Select[Range[100], Max[IntegerDigits[#]] > 1 &] (* _Paolo Xausa_, Oct 30 2024 *)
%o A136399 (Haskell)
%o A136399 a136399 n = a136399_list !! (n-1)
%o A136399 a136399_list = filter (any (> '1') . show) [0..]
%o A136399 -- _Reinhard Zumkeller_, Apr 25 2012
%o A136399 (Python)
%o A136399 def A136399(n):
%o A136399     def f(x):
%o A136399         s = str(x)
%o A136399         for i in range(l:=len(s)):
%o A136399             if s[i]>'1':
%o A136399                 break
%o A136399         else:
%o A136399             return n+int(s,2)
%o A136399         return n+int(s[:i]+'1'*(l-i),2)
%o A136399     m, k = n, f(n)
%o A136399     while m != k: m, k = k, f(k)
%o A136399     return m # _Chai Wah Wu_, Oct 16 2024
%o A136399 (Python)
%o A136399 def ok(n): return any(d > '1' for d in str(n))
%o A136399 print([k for k in range(76) if ok(k)]) # _Michael S. Branicky_, Oct 29 2024
%Y A136399 Cf. A007088, A054055, A064770.
%K A136399 nonn,base
%O A136399 1,1
%A A136399 _Reinhard Zumkeller_, Dec 30 2007