cp's OEIS Frontend

A035059 Numbers k such that 2^k does not contain the digit 4 (probably finite).

%I A035059 #34 Sep 08 2022 08:44:52
%S A035059 0,1,3,4,5,7,8,9,13,15,16,17,21,23,24,29,40,41,43,55,69,75,85,107
%N A035059 Numbers k such that 2^k does not contain the digit 4 (probably finite).
%C A035059 a(25) > 2*10^9 if it exists. - _Jon E. Schoenfield_ and _Michael S. Branicky_, Aug 02 2021
%t A035059 Join[{0}, Select[Range@10000, FreeQ[IntegerDigits[2^#], 4] &]] (* _Vincenzo Librandi_, May 07 2015 *)
%o A035059 (Magma) [n: n in [0..1000] | not 4 in Intseq(2^n) ]; // _Vincenzo Librandi_, May 07 2015
%o A035059 (Python)
%o A035059 N = 200; modder = 10**N; REPORT = 10**5
%o A035059 def ok(s):  return '4' not in s
%o A035059 def ok1(n): return ok(str(pow(2, n, modder)))
%o A035059 def afind(limit, startk=0, verbose=False):
%o A035059     full_tests = 0
%o A035059     for k in range(startk, limit):
%o A035059         if ok1(k):
%o A035059             full_tests += 1
%o A035059             if ok(str(pow(2, k))): print(k, end=", ")
%o A035059         if verbose and k and k%REPORT == 0:
%o A035059             print("[ ...", k, full_tests, "]")
%o A035059         k += 1
%o A035059 afind(10**6, verbose=True) # _Michael S. Branicky_, Aug 02 2021
%Y A035059 Cf. similar sequences listed in A035064.
%K A035059 nonn,base,more
%O A035059 1,3
%A A035059 _Patrick De Geest_, Nov 15 1998
%E A035059 Initial 0 inserted by _Vincenzo Librandi_, May 07 2015