Find Recursively Prime Primes The Recursively Prime Primes is are sequence of primes such that
p(1) = 2
p(n) = the p(n-1)th prime

Here is an example of how one might calculate the 4th Recursively Prime Prime.
p(4) = the p(3)th prime
p(3) = the p(2)th prime
p(2) = the p(1)th prime
p(1) = 2
p(2) = the 2nd prime
p(2) = 3
p(3) = the 3rd prime
p(3) = 5
p(4) = the 5th prime
p(4) = 11

You should write a program or function that when given n, outputs the nth Recursively Prime Prime.
You may choose to use 0 based indexing if you wish in which case you must indicate so in your answer.
This is code-golf so the goal is to minimize your byte count.

Test Cases
1 -&gt; 2
2 -&gt; 3
3 -&gt; 5
4 -&gt; 11
5 -&gt; 31
6 -&gt; 127
7 -&gt; 709
8 -&gt; 5381
9 -&gt; 52711


Relevant OEIS entry: OEIS A007097
Oasis, 3 bytes

The program is 0-indexed. Code:

&lt;q2


Uses the formula: a(n) = nth_prime(a(n-1) - 1), with the base case a(0) = 2.

Code explanation:

  2   = a(0)

&lt;     # Decrement a(n - 1) to get a(n - 1) - 1
 q    # prime(a(n - 1) - 1)


Try it online!