Introduction
As an example, let's take the number 7
. We then duplicate this and place 7 spaces in between. We get this:
7_______7
After that, we are going to decrease the number, until there are no spaces left. We get the following for the number 7:
7_______7
6543210
Then, we just merge the two of them, so:
7_______7
6543210 becomes
765432107
This will be out output for N = 7.
Looks easy, right? Now let's take N = 12. We again insert 12 spaces between the two numbers, which gives us:
12____________12
Then we start the decrement:
12____________12
111098765432
And this finally gives us:
1211109876543212
As you can see, the descending part ends at 2, not at 0.
Task
Given an integer, greater than 1, output the descending sequence as shown above.
Test cases
Input Output
2 2102
3 32103
4 432104
5 5432105
6 65432106
7 765432107
8 8765432108
9 98765432109
10 10987654321010
11 111098765432111
12 1211109876543212
13 13121110987654313
14 141312111098765414
15 1514131211109876515
20 201918171615141312111020
99 9998979695949392919089888786858483828180797877767574737271706968676665646362616059585756555453525150499
100 1009998979695949392919089888786858483828180797877767574737271706968676665646362616059585756555453525150100
This is code-golf, so the submission with the fewest number of bytes wins!