Primus-Orderus Primes Who are they?
Primus-Orderus Primes (POP) are primes which contain their order in the sequence of primes.
So the nth prime, in order to be POP, must contain all the digits of n in a certain way which I'll explain.
Examples
Let's get things clearer:
All digits of n must appear among the digits of POP in the same order they appear in n
The 6469th prime is 64679 which is POP because it contains all digits of 6469 in the right order .
1407647 is POP because it is the 107647th prime number
14968819 is POP (968819th prime).So this challenge is NOT OEIS (A114924)
1327 is NOT POP because it is the 217th prime (digits are not in the right order)
The Challenge
You guessed right!
Given an integer n, output the nth POP
Test Cases
input-&gt; output
1-&gt;17
3-&gt;14723    
5-&gt;57089
10-&gt;64553 
29-&gt;284833  
34-&gt;14968819

This is code-golf so the shortest answer in bytes wins!
All these should be 1-Indexed
Mathematica, 104 bytes

Extremely efficient

(t=i=1;While[t&lt;#+1,If[!FreeQ[Subsets[(r=IntegerDigits)@Prime@i,{Length@r@i}],r@i],t++];i++];Prime[i-1])&amp;



finds n=34 in under a minute