|
%I #16 Feb 27 2018 11:58:33
%S 1,10,11,21,31,41,51,61,71,81,91,100,101,102,103,104,105,106,107,108,
%T 109,110,111,121,131,141,151,161,171,181,191,201,210,211,221,231,241,
%U 251,261,271,281,291,301,310,311,321,331,341,351,361,371,381,391,401,410,411,421
%N Numbers n where d*n contains the digit d for all of d = 1,2,3,4,5,6,7,8,9.
%C Includes all numbers whose rightmost nonzero digit is a 1.
%H Robert Israel, <a href="/A298849/b298849.txt">Table of n, a(n) for n = 1..10000</a>
%e 12 times 5 = 60, which doesn't contain the digit 5; so 12 is not in this sequence.
%p filter:= n -> andmap(d -> has(convert(d*n,base,10),d), [$1..9]):
%p select(filter, [$1..1000]); # _Robert Israel_, Feb 27 2018
%t Select[Range[421], Function[n, NoneTrue[Range@ 9, FreeQ[IntegerDigits[n #], #] &]]] (* _Michael De Vlieger_, Jan 28 2018 *)
%o (PARI) isok(n) = {for (d=1, 9, if (! vecsearch(Set(digits(d*n)), d), return (0));); return(1);} \\ _Michel Marcus_, Jan 27 2018
%Y Cf. A296606.
%K nonn,base
%O 1,2
%A _J. Lowell_, Jan 27 2018
%E More terms from _Michel Marcus_, Jan 27 2018
|
