Return to Answer

added 387 characters in body

Source Link

edited May 26, 2022 at 16:34

Python, 7767 bytes

n=0
while n:=n+1:[print(k*k+k-n*min(2*k-n,1))for k in range(1,n+1)]

Port of Haskell. Outputs infinitely.

Old answer:

n=0
while n:=n+1:[print(n<2*k-1and-~k*k-n or(n-k)**2+k)for k in range(1,n+1)]

Outputs infinitely.

n=0
while n:=n+1:[print(n<2*k-1and-~k*k-n or(n-k)**2+k)for k in range(1,n+1)]

Outputs infinitely.

n=0
while n:=n+1:[print(k*k+k-n*min(2*k-n,1))for k in range(1,n+1)]

Port of Haskell. Outputs infinitely.

Old answer:

n=0
while n:=n+1:[print(n<2*k-1and-~k*k-n or(n-k)**2+k)for k in range(1,n+1)]

Source Link

created May 26, 2022 at 12:55

n=0
while n:=n+1:[print(n<2*k-1and-~k*k-n or(n-k)**2+k)for k in range(1,n+1)]

Outputs infinitely.