2 deleted 3 characters in body
source | link

Haskell, 19 bytes

do n<-[1..];[n,1];[1-n,n]

Produces the infinite list [1,0[0,21,-1,32,-2,43,-3,54,-4,65,-5,76,-6,87,-7,...

Haskell allows infinite lists natively. Printing such a list will prints its elements one a time forever.

Haskell, 19 bytes

do n<-[1..];[n,1-n]

Produces the infinite list [1,0,2,-1,3,-2,4,-3,5,-4,6,-5,7,-6,8,-7,...

Haskell allows infinite lists natively. Printing such a list will prints its elements one a time forever.

Haskell, 19 bytes

do n<-[1..];[1-n,n]

Produces the infinite list [0,1,-1,2,-2,3,-3,4,-4,5,-5,6,-6,7,-7...

Haskell allows infinite lists natively. Printing such a list will prints its elements one a time forever.

1
source | link

Haskell, 19 bytes

do n<-[1..];[n,1-n]

Produces the infinite list [1,0,2,-1,3,-2,4,-3,5,-4,6,-5,7,-6,8,-7,...

Haskell allows infinite lists natively. Printing such a list will prints its elements one a time forever.