3 added 102 characters in body

# Python 2, 71 68 bytes

I bet a recursive solution could be shorter, but I'm having a hard time formulating this into one.

n=input()
i=0
o=""
while i<n:
i+=1;j=i
while j:o+=j;j-=1
print o


Try it online

# Python 2, 71 68 bytes

n=input()
i=0
o=""
while i<n:
i+=1;j=i
while j:o+=j;j-=1
print o


Try it online

# Python 2, 71 68 bytes

I bet a recursive solution could be shorter, but I'm having a hard time formulating this into one.

n=input()
i=0
o=""
while i<n:
i+=1;j=i
while j:o+=j;j-=1
print o


Try it online

2 added 123 characters in body

# Python 2, 7171 68 bytes

lambdan=input()
i=0
o=""
while ni<n:"".join("".join(jfor
j in range(i+1,0,-1))for ii+=1;j=i
in range(n))  while j:o+=j;j-=1
print o


# Python 2, 71 bytes

lambda n:"".join("".join(jfor j in range(i+1,0,-1))for i in range(n))


Try it online

# Python 2, 71 68 bytes

n=input()
i=0
o=""
while i<n:
i+=1;j=i
while j:o+=j;j-=1
print o


Try it online

1

# Python 2, 71 bytes

lambda n:"".join("".join(jfor j in range(i+1,0,-1))for i in range(n))


Try it online