cp's OEIS Frontend

A096093 Numbers, not divisible by 10, whose digits can be permuted to get a proper divisor.

%I A096093 #9 Jun 01 2020 20:47:38
%S A096093 105,108,405,702,703,1001,1005,1008,1053,2002,2016,2025,2079,2106,
%T A096093 3003,3024,3042,3045,3105,3402,4004,4005,5005,5049,6006,6031,6045,
%U A096093 6048,6072,6075,6084,6105,6804,7007,7011,7128,7425,8008,8019,8092,8316,8712,9009
%N A096093 Numbers, not divisible by 10, whose digits can be permuted to get a proper divisor.
%H A096093 Robert Israel, <a href="/A096093/b096093.txt">Table of n, a(n) for n = 1..1000</a>
%e A096093 105 is a term as 015 is a proper divisor of 105.
%e A096093 2178 is a proper divisor of 8712 and 8712/2178=4.
%e A096093 1089 is a proper divisor of 9801 and 9801/1089=9.
%p A096093 filter:= proc(n) local L,nL,P;
%p A096093   L:= convert(n,base,10);
%p A096093   nL:= nops(L);
%p A096093   P:= subs(L=NULL, combinat:-permute(L));
%p A096093   ormap(p -> n mod add(p[i]*10^(i-1),i=1..nL) = 0, P)
%p A096093 end proc:
%p A096093 select(filter, [seq(seq(10*i+j,j=1..9),i=1..10000)]); # _Robert Israel_, Jun 01 2020
%t A096093 f[n_] := Union[ IntegerQ /@ Drop[ n/FromDigits /@ Permutations[IntegerDigits[n]], 1]][[ -1]]; Select[ Range[ 9015], Mod[ #, 10] != 0 && f[ # ] == True &] (* _Robert G. Wilson v_, Jun 23 2004 *)
%Y A096093 Cf. A096092.
%K A096093 base,nonn
%O A096093 1,1
%A A096093 _Amarnath Murthy_, Jun 22 2004
%E A096093 Edited, corrected and extended by _Robert G. Wilson v_, Jun 23 2004