|
%I #9 Dec 28 2018 02:49:36
%S 2,3,5,7,22,52,255,57,23,232,372,37,533,2322,235,53,2537,732,335,355,
%T 73,237,332,2225,2522,2222,2575,535,327,2373,22225,2227,7535,3753,
%U 2235,755,2355,7335,27555,23355,537,2353,573,772,27777,5373,2532,223,227,5725,233
%N Least multiple of prime(n) containing only prime digits (2,3,5,7).
%C a(n) = prime(n) if prime(n) is in A019546.
%H Robert Israel, <a href="/A113590/b113590.txt">Table of n, a(n) for n = 1..10000</a>
%p N:= 100: # to get a(1)..a(N)
%p pn:= ithprime(N):
%p count:= 0:
%p digs:= [2,3,5,7]:
%p for d from 1 while count < N do
%p for m from 4^d to 2*4^d-1 while count < N do
%p L:= convert(m,base,4);
%p n:= add(digs[L[i]+1]*10^(i-1),i=1..nops(L)-1);
%p ps:= select(p -> p <= pn and not assigned(A[p]), numtheory:-factorset(n));
%p count:= count + nops(ps);
%p for p in ps do A[p]:= n od:
%p od od:
%p seq(A[ithprime(i)],i=1..N); # _Robert Israel_, Dec 27 2018
%Y Cf. A019546, A113591.
%K base,easy,nonn
%O 1,1
%A _Amarnath Murthy_, Nov 07 2005
%E More terms from Nick Woods (njw130(AT)psu.edu), Apr 25 2006
%E a(44) and a(50) corrected by _Robert Israel_, Dec 27 2018
|
