def 表(f,x):
for X in range(x):
yield (X,f(X))
def Recursion(f,n,x):
P = [n]
yield (0,n)
for X in range(x):
yield (X+1,f(P[-1]))
P.append(f(P[-1]))
def D(f):
return (lambda x,k=f:k(x)-k(x-1))
for x,y in Recursion((lambda x:(x*(1+(1/2)))),1.1,9999999):
try:
print(f"{x}:{y}")
except:
break
To embed this project on your website, copy the following code and paste it into your website's HTML: