OFFSET
1,2
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
MATHEMATICA
q[n_] := AllTrue[Divisors[n], StringContainsQ[IntegerString[n, 2], IntegerString[#, 2]] &]; Select[Range[100], q] (* Amiram Eldar, Jun 05 2022 *)
PROG
(Haskell)
import Data.List (unfoldr, isInfixOf)
a123345 n = a123345_list !! (n-1)
a123345_list = filter
(\x -> all (`isInfixOf` b x) $ map b $ a027750_row x) [1..] where
b = unfoldr (\x -> if x == 0 then Nothing else Just $ swap $ divMod x 2)
-- Reinhard Zumkeller, Oct 27 2012
(Python)
from sympy import divisors
def ok(n):
b = bin(n)[2:]
return n and all(bin(d)[2:] in b for d in divisors(n, generator=True))
print([k for k in range(119) if ok(k)]) # Michael S. Branicky, Jun 05 2022
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Oct 12 2006
STATUS
approved