Post History
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) $$
Answer
#1: Initial revision
by
Razetime
·
2021-08-12T11:14:00Z (over 3 years ago)
# [Husk], 3 bytes
∫İ1
[Try it online!][TIO-ks8to6uj]
[Husk]: https://github.com/barbuz/Husk
[TIO-ks8to6uj]: https://tio.run/##yygtzv7//1HH6iMbDP//BwA "Husk – Try It Online"
Scan from left over all odd numbers with addition.
Uses this formula:
$$
n^2 = \sum_{k=1}^n(2k-1)
$$