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.
%I A063571 #13 Apr 03 2021 15:35:07
%S A063571 4,3,3,5,2,3,2,5,1,4,10,14,3,9,6,7,8,9,10,12,7,6,17,21,10,17,6,5,9,20,
%T A063571 26,25,5,21,9,15,12,10,13,14,4,10,9,14,6,11,14,12,17,13,18,3,7,29,13,
%U A063571 13,16,25,11,11,20
%N A063571 Smallest power of 8 having n in its decimal representation.
%C A063571 Variant of A062525 allowing only exponents larger than zero. [From _R. J. Mathar_, Dec 15 2008]
%H A063571 Harvey P. Dale, <a href="/A063571/b063571.txt">Table of n, a(n) for n = 0..1000</a>
%t A063571 a = {}; Do[k = 1; While[ StringPosition[ ToString[8^k], ToString[n] ] == {}, k++ ]; a = Append[a, k], {n, 0, 60} ]; a
%t A063571 sp8[n_]:=Module[{k=1},While[SequenceCount[IntegerDigits[ 8^k], IntegerDigits[ n]]<1,k++];k]; Array[sp8,70,0] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Apr 07 2017 *)
%o A063571 (Python)
%o A063571 def a(n):
%o A063571 k, pow8, s = 1, 8, str(n)
%o A063571 while s not in str(pow8): k += 1; pow8 *= 8
%o A063571 return k
%o A063571 print([a(n) for n in range(61)]) # _Michael S. Branicky_, Apr 03 2021
%K A063571 base,nonn
%O A063571 0,1
%A A063571 _Robert G. Wilson v_, Aug 10 2001