Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 41042

The challenge involves Fibonacci numbers or one of their generalizations.

1
vote
J-uby, 8 6 bytes :++2.* In J-uby, + on a proc (or a symbol in this case, as symbols can be used as procs in J-uby), defines a recurrence relation. It takes a starter array, and then produces a fu …
answered Feb 15 '17 by Cyoce
4
votes
Cy, 33 31 30 bytes (non-competing) This is going for the function option (takes N, outputs F(N)) 0 1 :>i {1 - $&+ times} &if :< Ungolfed/explanation: 0 1 # first two fibs are 0, 1 :>i …
answered Mar 25 '16 by Cyoce
15
votes
3answers
the previous N numbers are summed, instead of the traditional 2 of the Fibonacci sequence (said to be the "duonacci sequence"). He then asked to take two inputs, X and N, then output the Xth N-nacci …
asked Jan 31 '16 by Cyoce
1
vote
PlatyPar, 7 bytes 0A1wAC+ Try it online! Explanation: 0A1 ## push first two Fibonacci numbers to stack and print them w ## while last item != 0 (always true) A ## print … the most recently calculated Fibonacci number C+ ## push the sum of the last two items of the stack This one is a sequence. …
answered Jan 22 '16 by Cyoce
1
vote
Cy, 11 + 1 (-p flag) = 12 bytes (non-competing) This is going for the infinite stream 0 1 $&+ &do (the -p flag implicitly prints every non-block value pushed to the stack) Literally, push 0 p …
answered Mar 25 '16 by Cyoce
4
votes
Detour (non-competing), 8 bytes [$<<]!S. Try it online! This one is shorter than the word "fibonacci" [$<<]!S. Fibonacci explanation: [ ] # while n > 0 $<< # replace n with [n …
answered Jan 20 '16 by Cyoce
1
vote
in action. More "readable" version: Detour, 267 bytes :$v 1v q # split into branches + # push sum of last 2 fibonacci numbers to branch 2 { p , p ^ # print branch …
answered Jan 27 '16 by Cyoce