A242905 - OEIS

%I #7 May 26 2014 10:34:44

%S 3,13,31,103,1013,1031,1103,1301,3011,10103,10301,11003,13001,30011,

%T 100103,103001,1000133,1000313,1001303,1003103,1010033,1013003,

%U 1030031,1031003,1033001,1100303,1300031,1330001

%N 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.

%p with(numtheory):lst:={3}:nn:=250000:x0:=convert(3,base,10):n0:=nops(x0):

%p   for n from 3 to nn do:

%p      p:=ithprime(n):x:=convert(p,base,10):

%p      x1:=x:n1:=nops(x):c:=0:

%p         for i from 1 to n0 do:

%p          ii:=0:

%p            for j from 1 to n1 while(ii=0)do:

%p              if x0[i]=x[j]

%p              then

%p              c:=c+1:x[j]:=99:ii:=1:

%p              else

%p              fi:

%p            od:

%p          od:

%p           if c=n0

%p           then

%p           lst:=lst union {p}:n0:=n1:x0:=x1:

%p           else

%p           fi:

%p     od:

%p     print(lst):

%Y Cf. A242904, A242906, A242907.

%K nonn,base

%O 1,1

%A _Michel Lagneau_, May 26 2014