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 A337941 #20 Oct 06 2020 06:19:29
%S A337941 1,2,3,4,5,6,7,8,9,11,12,15,24,1111111111111111111,
%T A337941 11111111111111111111111
%N A337941 Numbers whose divisors are all Zuckerman numbers (A007602).
%C A337941 Inspired by A337741.
%C A337941 Zuckerman numbers are numbers that are divisible by the product of their digits (see link).
%C A337941 The next term is the repunit prime R_317 which is too large to include in the data.
%C A337941 Primes in this sequence are 2, 3, 5, 7 and all the repunit primes (see A004023).
%C A337941 This sequence is infinite if and only if there are infinitely many repunit primes.
%H A337941 Giovanni Resta, <a href="http://www.numbersaplenty.com/set/Zuckerman_number/">Zuckerman numbers</a>, Numbers Aplenty
%e A337941 6 is a term since all the divisors of 6, i.e., 1, 2, 3 and 6, are Zuckerman numbers.
%t A337941 zuckQ[n_] := (prod = Times @@ IntegerDigits[n]) > 0 && Divisible[n, prod]; Select[Range[24], AllTrue[Divisors[#], zuckQ] &] (* _Amiram Eldar_, Oct 01 2020 *)
%o A337941 (PARI) isok(m) = {fordiv(m, d, my(p=vecprod(digits(d))); if (!p || (d % p), return (0))); return (1);} \\ _Michel Marcus_, Oct 05 2020
%Y A337941 Subsequence of A007602.
%Y A337941 Similar sequences: A062687, A190217, A308851, A329419, A337741.
%Y A337941 Cf. A004023, A335037, A335038.
%Y A337941 Cf. A004022 (subsequence of prime repunits).
%K A337941 nonn,base
%O A337941 1,2
%A A337941 _Bernard Schott_, Oct 01 2020