Triangle by recursive (pv2b)

def f(n,s):
 if n<=l:
\x09f(n+s-1,s+1)
\x09while n<=l:print n,;n+=s;s+=1
\x09print
l=input()
f(1,2)

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return top