|
%I #12 Apr 13 2021 23:30:49
%S 1,10,15,31,100,101,102,103,104,105,106,107,108,109,110,120,127,130,
%T 140,150,160,170,180,190,201,210,301,310,401,410,501,510,511,601,610,
%U 701,710,801,810,901,910,1000,1001,1002,1003,1004
%N Positive numbers k such that every base-2 digit of k is a base-10 digit of k.
%H Reinhard Zumkeller, <a href="/A037379/b037379.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o import Data.List ((\\), nub)
%o a037379 n = a037379_list !! (n-1)
%o a037379_list = filter f [1..] where
%o f x = null $ nub (ds 2 x) \\ nub (ds 10 x)
%o ds b x = if x > 0 then d : ds b x' else [] where (x', d) = divMod x b
%o -- _Reinhard Zumkeller_, May 30 2013
%Y Cf. A037372, A037373, A037374, A037375, A037376, A037377, A037378.
%K nonn,base
%O 1,2
%A _Clark Kimberling_
|
