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 A209933 #27 Sep 29 2024 21:10:09 %S A209933 1,2,3,4,5,6,7,8,9,11,12,15,22,24,33,44,48,55,66,77,88,99,132,264 %N A209933 Numbers that are divisible by all digits of their divisors. %C A209933 There are 24 terms < 10000. Conjecture: next term a(25) = prime repunit with 19 digits 1. %C A209933 Supersequence of A004022 (prime repunits). Subsequence of A034838 (numbers k that are divisible by every digit of k). %C A209933 Any further terms are > 10^11. - _Lucas A. Brown_, Sep 29 2024 %H A209933 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/A209933.py">Python program</a>. %e A209933 Number 264 with divisors 1, 2, 3, 4, 6, 8, 11, 12, 22, 24, 33, 44, 66, 88, 132, 264 is in sequence because all possible digits its divisors (1, 2, 3, 4, 6, 8) are its divisors. %o A209933 (Haskell) %o A209933 import Data.List (unfoldr, nub, sort) %o A209933 a209933 n = a209933_list !! (n-1) %o A209933 a209933_list = filter f [1..] where %o A209933 f x = head (ds x) /= 0 && all (== 0) (map ((mod x)) (ds x)) where %o A209933 ds = sort . nub . concatMap (unfoldr (\z -> %o A209933 if z == 0 then Nothing else Just $ swap $ divMod z 10)) . %o A209933 a027750_row %o A209933 -- _Reinhard Zumkeller_, Apr 19 2012 %Y A209933 Cf. A004022, A034838, A037278. %Y A209933 Cf. A027750. %K A209933 nonn,base,more,hard %O A209933 1,2 %A A209933 _Jaroslav Krizek_, Apr 16 2012