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 A204095 #25 Feb 09 2020 02:42:10
%S A204095 0,8,80,88,800,808,880,888,8000,8008,8080,8088,8800,8808,8880,8888,
%T A204095 80000,80008,80080,80088,80800,80808,80880,80888,88000,88008,88080,
%U A204095 88088,88800,88808,88880,88888,800000,800008,800080,800088,800800,800808,800880,800888
%N A204095 Numbers whose base 10 digits are a subset of {0, 8}.
%H A204095 Reinhard Zumkeller, <a href="/A204095/b204095.txt">Table of n, a(n) for n = 0..10000</a>
%F A204095 a(n) = 8 * A007088(n).
%p A204095 f:= proc(n) local L; L:= convert(n,base,2); add(8*L[i]*10^(i-1),i=1..nops(L)) end proc:
%p A204095 seq(f(n),n=0..100); # _Robert Israel_, Jul 28 2014
%t A204095 Table[8 FromDigits[IntegerDigits[n, 2]], {n, 0, 39}] (* _Alonso del Arte_, Jan 10 2012 *)
%o A204095 (Haskell)
%o A204095 a204095 n = a204095_list !! n
%o A204095 a204095_list = map (* 8) a007088_list
%o A204095 (PARI) a(n)=8*subst(Pol(binary(n)), x, 10);
%o A204095 for(n=0, 20, print1(a(n), ", ")) \\ _Felix Fröhlich_, Jul 26 2014
%Y A204095 Cf. A078247, A169965, A169966, A169967, A169964, A204093, A204094, A097256.
%K A204095 nonn,base
%O A204095 0,2
%A A204095 _Reinhard Zumkeller_, Jan 10 2012
%E A204095 Definition corrected by _M. F. Hasler_, Feb 08 2020