Timeline for Generate the Stöhr sequence
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 16, 2020 at 15:41 | comment | added | ulidtko |
Hm! A lazy list (generator) is against the rules, but a lambda isn't? Here you go then... 16 bytes: \n->1:2:[4,7..n].
|
|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jan 29, 2015 at 6:28 | comment | added | proud haskeller | @swish my bad, I thought the parenthesis around the list are redundant. | |
| Jan 29, 2015 at 6:25 | comment | added | swish |
@proudhaskeller Do you mean (`take`(1:2:[4,7..]))? It's the same length, or can it be shorten somehow?
|
|
| Jan 28, 2015 at 20:14 | comment | added | proud haskeller | @Optimizer The point is that the computer won't do any extra calculation if it wasn't needed. | |
| Jan 28, 2015 at 20:12 | comment | added | proud haskeller |
You can shorten the take version using section syntax
|
|
| Jan 26, 2015 at 20:10 | comment | added | swish | Let us continue this discussion in chat. | |
| Jan 26, 2015 at 20:09 | comment | added | Optimizer | @swish yes and that is your second code, which should actually be counted. | |
| Jan 26, 2015 at 20:08 | comment | added | swish |
@Optimizer take 14$1:2:[4,7..]
|
|
| Jan 26, 2015 at 20:06 | comment | added | Optimizer | How do I tell it to stop at 14th number ?> | |
| Jan 26, 2015 at 20:04 | comment | added | swish | @Optimizer The chunk that produces the sequence. | |
| Jan 26, 2015 at 20:03 | comment | added | Optimizer | @swish I don't understand. What is lazy here ? | |
| Jan 26, 2015 at 20:01 | comment | added | swish | @Optimizer Actually, being lazy means no extra output would be generated until you ask for it, and you can ask for any terms you want. | |
| Jan 26, 2015 at 19:42 | comment | added | Optimizer | @WChargin trying to being oversmart isn't new. Taking the OP's wording too literally and producing extra output than required both are considered as standard loopholes. | |
| Jan 26, 2015 at 19:41 | comment | added | wchargin | @Optimizer Well, technically, you have to "generate the first n elements of the Stöhr sequence"—it doesn't say you can't generate the rest of them as well! It doesn't say that you have to take an input, either. swish's original code actually does generate the first n terms, for any n. | |
| Jan 26, 2015 at 11:33 | history | edited | swish | CC BY-SA 3.0 |
added 107 characters in body
|
| Jan 26, 2015 at 11:28 | review | Low quality posts | |||
| Jan 26, 2015 at 11:38 | |||||
| Jan 26, 2015 at 11:15 | comment | added | Optimizer |
You have to take an input and print only the first n numbers.
|
|
| Jan 26, 2015 at 11:09 | history | answered | swish | CC BY-SA 3.0 |