login
A242905
a(n+1) is the smallest prime > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(1)=3.
3
3, 13, 31, 103, 1013, 1031, 1103, 1301, 3011, 10103, 10301, 11003, 13001, 30011, 100103, 103001, 1000133, 1000313, 1001303, 1003103, 1010033, 1013003, 1030031, 1031003, 1033001, 1100303, 1300031, 1330001
OFFSET
1,1
MAPLE
with(numtheory):lst:={3}:nn:=250000:x0:=convert(3, base, 10):n0:=nops(x0):
for n from 3 to nn do:
p:=ithprime(n):x:=convert(p, base, 10):
x1:=x:n1:=nops(x):c:=0:
for i from 1 to n0 do:
ii:=0:
for j from 1 to n1 while(ii=0)do:
if x0[i]=x[j]
then
c:=c+1:x[j]:=99:ii:=1:
else
fi:
od:
od:
if c=n0
then
lst:=lst union {p}:n0:=n1:x0:=x1:
else
fi:
od:
print(lst):
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Michel Lagneau, May 26 2014
STATUS
approved