Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #18 Mar 09 2015 19:58:01
%S 15628,15678,16038,17082,17820,19084,20457,20754,21658,24507,26910,
%T 27504,28156,28651,30976,32890,34902,35046,35496,36508,36970,37096,
%U 37690,38870,40596,40898,43076,43670,45068,46740,46970,47690,48504,48592,50076,50346
%N Values n, where n = p * q, and n, p, and q together contain all 10 digits at least once, and no digit is in more than one of n, p or q.
%e a(1) is 15628 = 4 * 3907, using all 10 digits.
%e 20748 = 13 * 1596, using all 10 digits, but is NOT a member of this sequence, because the digit 1 appears in both p and q.
%o (PARI) isok(n) = {fordiv(n, d, q = n/d; sn = vecsort(digits(n),,8); sd = vecsort(digits(d),,8); sq = vecsort(digits(q),,8); sa = vecsort(concat(sn, concat(sd, sq)),,8); if ((#sa == 10) && (#sn + #sd + #sq == 10), return (1));); return (0);} \\ _Michel Marcus_, Feb 07 2015
%Y Cf. A195814 (a finite subsequence).
%Y Cf. A253172 (a supersequence, which allows for duplicate digits in n, p and q).
%K nonn,easy,base
%O 1,1
%A _Randy L. Ekl_, Dec 28 2014