JavaScript (V8), 28 bytes

for(x=y=0;;++y)print(x+=++y)

Try it online!

posted almost 5 years ago

CC BY-SA 4.0

Shaggy‭

2491 reputation 4 140 252 188

Husk, 3 bytes

∫İ1

Try it online!

Scan from left over all odd numbers with addition.

Uses this formula:

$$ n^2 = \sum_{k=1}^n(2k-1) $$

posted almost 5 years ago

CC BY-SA 4.0

Razetime‭

3000 reputation 42 65 335 83

Japt, 9 bytes

No infinite lists in Japt so we'll have to go with a recursive solution.

ßOpTµJJµ2

Test it

ßOpTµJJµ2
ß             :Recursive call with (irrelevant) argument
 Op           :  Output with trailing newline (returns undefined and second argument is ignored)
   TµJ        :    Decrement T (initially 0) by J (initially -1)
      Jµ2     :    Decrement J by 2

posted almost 5 years ago

CC BY-SA 4.0

5y ago

Shaggy‭

2491 reputation 4 140 252 188

Perl, 20 bytes

Counts up from 1.

say$a+=$b++while++$b

posted 4 months ago

CC BY-SA 4.0

jhnc‭

551 reputation 0 45 55 98

PHP, 57 bytes

<?php $x=0;$y=1;while(1){echo(string)($x+=$y)." ";$y+=2;}

Try it online!

PHP's a nice language, I tell ya.

posted almost 5 years ago

CC BY-SA 4.0

General Sebast1an‭

1351 reputation 53 97 144 328

Lua, 41 40 bytes

x=0 y=1while""do print(x)x=x+y y=y+2 end

Try it online!

posted almost 5 years ago

CC BY-SA 4.0

5y ago

General Sebast1an‭

1351 reputation 53 97 144 328

Python 3, 34 bytes

x=0;y=1
while 1:x+=y;print(x);y+=2

Try it online!

1 is the int equivalent to True, which helps save bytes.

posted almost 5 years ago

CC BY-SA 4.0

5y ago

General Sebast1an‭

1351 reputation 53 97 144 328

C (clang), 47 45 43 bytes

i,j;main(){for(;printf("%i ",i-=~j);j+=2);}

Try it online!

Golfed 2 bytes from inspiration of @Shaggy's answer. Golfed 2 bytes by @m90.

posted almost 5 years ago

CC BY-SA 4.0

5y ago

General Sebast1an‭

1351 reputation 53 97 144 328