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 A341433 #7 Feb 19 2021 03:36:13 %S A341433 1,3,9,21,39,51,99,249,261,309,669,729,2559,2571,2619,2979,3051,4239, %T A341433 7179,7191,32589,32601,32649,32661,33009,33021,37209,37269,37629, %U A341433 51489,92649,92709,93069,97281,272889,274509,543099,543111,543159,543519,543591,544779 %N A341433 Numbers that are divisible by the product of their digits in primorial base representation. %C A341433 The primorial base repunits (A143293) are all terms since their product of digits in primorial base is 1. %C A341433 All the terms are zeroless in primorial base, and therefore they are terms of A328574. In particular, since the last digit of even numbers in primorial base is 0, all the terms are odd numbers. %H A341433 Amiram Eldar, <a href="/A341433/b341433.txt">Table of n, a(n) for n = 1..150</a> %H A341433 Wikipedia, <a href="https://en.wikipedia.org/wiki/Mixed_radix#Primorial_number_system">Primorial number system</a>. %H A341433 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>. %e A341433 9 is a term since 9 in primorial base is 111 (9 = 3! + 2! + 1!) and 9 is divisible by 1*1*1 = 1. %t A341433 max = 12; bases = Prime@Range[max, 1, -1]; nmax = Times @@ bases - 1; q[n_] := FreeQ[(d = IntegerDigits[n, MixedRadix[bases]]), 0] && Divisible[n, Times @@ d]; Select[Range[1, 10^5, 2], q] %Y A341433 A143293 is a subsequence. %Y A341433 Subsequence of A328574. %Y A341433 Cf. A007602, A049345, A235168, A286590, A333426. %K A341433 nonn,base %O A341433 1,2 %A A341433 _Amiram Eldar_, Feb 11 2021