login
a(1) = 1; a(n) = smallest multiple of n (>n) using all nonprime digits (1,4,6,8,9 and 0) if n is a prime else using all prime digits and 1 if n is composite; or 0 if no such number exists.
1

%I #5 Dec 05 2013 19:55:34

%S 1,4,6,12,10,12,14,32,27,0,44,72,91,112,75,32,68,72,114,0,231,132,46,

%T 72,75,52,135,112,116,0,186,352,132,272,175,72,111,152,117,0,164,252,

%U 86,132,135,322,94,1152,735,0,153,312,106,1512,275,112,171,232,118,0,488

%N a(1) = 1; a(n) = smallest multiple of n (>n) using all nonprime digits (1,4,6,8,9 and 0) if n is a prime else using all prime digits and 1 if n is composite; or 0 if no such number exists.

%C a(10k) = 0. Are there other values of n such that a(n) =0?

%C A pigeonhole argument shows the conjecture to be true (that only a(10k) = 0). - _Joshua Zucker_, May 08 2006

%K base,nonn

%O 1,2

%A _Amarnath Murthy_, Aug 29 2002

%E Corrected and extended by _Joshua Zucker_, May 08 2006