The sequence of range-exponentiated integers Consider a triangle where the Nth row (1-indexed) is the array of the first N positive integer powers of N. Here are the first few rows:

N | Triangle

1 | 1
2 | 2 4
3 | 3 9 27
4 | 4 16 64 256
5 | 5 25 125 625 3125
...

Now if we concatenate those powers into a single sequence, we get OEIS A075363:
1, 2, 4, 3, 9, 27, 4, 16, 64, 256, 5, 25, 125, 625, 3125, 6, 36, 216, 1296, 7776, 46656 ...


Given an integer N, your task is to return the Nth term of this sequence. You can choose either 0 or 1-indexing.
Test cases
1-indexed:

N  -> Output

1  -> 1
2  -> 2
3  -> 4
5  -> 9
10 -> 256
12 -> 25
15 -> 3125

0-indexed:

N  -> Output

0  -> 1
1  -> 2
2  -> 4
4  -> 9
9  -> 256
11 -> 25
14 -> 3125

Note that these loopholes are forbidden by default. This is code-golf, thus the  shortest valid submission in each language wins!
Python 3, 39 bytes

1-indexed


f=lambda x,n=1:n**x*(x&lt;=n)or f(x-n,n+1)


Try it online!