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 A037405 #19 Aug 05 2021 07:02:19
%S A037405 1,2,3,4,5,6,7,9,18,27,36,45,54,63,73,124,137,146,177,210,219,283,284,
%T A037405 292,356,365,429,438,502,511,568,576,586,763,768,769,772,897,906,942,
%U A037405 945,946,950,970,1100,1152,1163,1172,1199,1474
%N A037405 Numbers k such that every base-8 digit of k is a base-9 digit of k.
%H A037405 Reinhard Zumkeller, <a href="/A037405/b037405.txt">Table of n, a(n) for n = 1..10000</a>
%t A037405 bQ[n_]:=Module[{idn8=Union[IntegerDigits[n,8]],idn9=Union[ IntegerDigits[ n,9]]},And@@ (MemberQ[ idn9,#]&/@idn8)]; Select[Range[1500],bQ] (* _Harvey P. Dale_, Jul 17 2011 *)
%o A037405 (Haskell)
%o A037405 import Data.List ((\\), nub)
%o A037405 a037405 n = a037405_list !! (n-1)
%o A037405 a037405_list = filter f [1..] where
%o A037405 f x = null $ nub (ds 8 x) \\ nub (ds 9 x)
%o A037405 ds b x = if x > 0 then d : ds b x' else [] where (x', d) = divMod x b
%o A037405 -- _Reinhard Zumkeller_, May 30 2013
%Y A037405 Cf. A007094, A007095.
%Y A037405 Cf. A037406.
%K A037405 nonn,base
%O A037405 1,2
%A A037405 _Clark Kimberling_