C++ experts please help! Recursion!

Will rate!

Write a function with one positive into parameter called n. The function will write 2^n-1 integers (where A is the exponentiation operation). Here are the patterns of output for various values of n: n=1: Output is: 1 n=2: Output is: 1 2 1 n=3: Output is: 1 2 1 3 1 2 1 n=4: Output is: 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 And so on