Timeline for Square pyramidal numbers
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2017 at 15:08 | history | edited | Emigna | CC BY-SA 3.0 | edited body |
| Oct 18, 2017 at 14:59 | comment | added | Not a tree | (I should mention that I got the l idea from Martin Ender's Labyrinth answer.) | |
| Oct 18, 2017 at 9:52 | comment | added | Emigna | @Notatree: Unfortunately we aren't allowed to start at 1, but it still saves 2 bytes. Thanks! | |
| Oct 18, 2017 at 9:51 | history | edited | Emigna | CC BY-SA 3.0 | added 45 characters in body |
| Oct 18, 2017 at 6:28 | comment | added | Emigna | @Notatree: Very nice idea using l. Checking with OP if it is okay to start at 1. | |
| Oct 18, 2017 at 2:00 | comment | added | Not a tree | Or 11 bytes (prints forever, starting at N=1): Try it online! | |
| Oct 18, 2017 at 1:43 | comment | added | Not a tree | 14 bytes (12+2 for -v flag): ::1+:}+**6,n (Try it online!) | |
| Oct 17, 2017 at 14:32 | history | edited | Emigna | CC BY-SA 3.0 | deleted 6 characters in body |
| Oct 17, 2017 at 14:18 | history | answered | Emigna | CC BY-SA 3.0 |