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 A037401 #12 Aug 22 2021 09:22:04 %S A037401 1,2,3,4,5,35,123,154,215,331,512,521,1014,1024,1045,1054,1085,1135, %T A037401 1145,1151,1295,1302,1303,1305,1350,1440,1450,1504,1506,1507,1520, %U A037401 1530,1540,1555,1559,1562,1579,1583,1592,1639,1653 %N A037401 Numbers k such that every base-6 digit of k is a base-10 digit of k. %H A037401 Reinhard Zumkeller, <a href="/A037401/b037401.txt">Table of n, a(n) for n = 1..10000</a> %o A037401 (Haskell) %o A037401 import Data.List ((\\), nub) %o A037401 a037401 n = a037401_list !! (n-1) %o A037401 a037401_list = filter f [1..] where %o A037401 f x = null $ nub (ds 6 x) \\ nub (ds 10 x) %o A037401 ds b x = if x > 0 then d : ds b x' else [] where (x', d) = divMod x b %o A037401 -- _Reinhard Zumkeller_, May 30 2013 %o A037401 (Haskell) %o A037401 import Data.List ((\\), nub) %o A037401 a037401 n = a037401_list !! (n-1) %o A037401 a037401_list = filter f [1..] where %o A037401 f x = null $ nub (ds 6 x) \\ nub (ds 10 x) %o A037401 ds b x = if x > 0 then d : ds b x' else [] where (x', d) = divMod x b %o A037401 -- _Reinhard Zumkeller_, May 30 2013 %Y A037401 Cf. A037398, A037399, A037400. %Y A037401 Cf. A037398, A037399, A037400. %K A037401 nonn,base %O A037401 1,2 %A A037401 _Clark Kimberling_