# [Python](https://www.python.org), 67 bytes

<pre><code class="lang-python">n=0
while n:=n+1:[print(k*k+k-n*min(2*k-n,1))for k in range(1,n+1)]</code></pre>

[Attempt This Online!](https://ato.pxeger.com/run?1=m72soLIkIz9vwYKlpSVpuhY3nfNsDbjKMzJzUhXyrGzztA2toguKMvNKNLK1srWzdfO0cjPzNIy0gCwdQ03NtPwihWyFzDyFosS89FQNQx2gBs1YiFFQE2EmAwA)

Port of Haskell. Outputs infinitely.

Old answer:
## [Python](https://www.python.org), 77 bytes

<pre><code class="lang-python">n=0
while n:=n+1:[print(n&lt;2*k-1and-~k*k-n or(n-k)**2+k)for k in range(1,n+1)]</code></pre>

[Attempt This Online!](https://ato.pxeger.com/run?1=m72soLIkIz9vwYKlpSVpuhY3ffNsDbjKMzJzUhXyrGzztA2toguKMvNKNPJsjLSydQ0T81J067KBrDyF_CKNPN1sTS0tI-1szbT8IoVshcw8haLEvPRUDUMdoFbNWIihULNhdgAA)