Search Results
| 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 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| 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 fibonacci
Search options not deleted
user 108687
The challenge involves Fibonacci numbers or one of their generalizations.
0
votes
First-n Fibonacci sequence elements
Uiua, 12 bytes
[◌◌⍥⊃+.:0:1]
Try it online
Outputs in reverse order.
- 8,592
1
vote
Fibonacci function or sequence
A["length"]:F<N,[...L,1],B,[...A,...B]>
Try it at the TS playground
This is a generic type F taking a number type N and outputting the Nth Fibonacci number, 0-indexed. … L keeps track of which Fibonacci number we’re on, and A and B are unary numbers (tuple-types of 1s) that track \$ f(n) \$ and \$ f(n + 1) \$ respectively. …
- 8,592
1
vote
Fibonacci function or sequence
.
◌ # Then pop the top of the stack, which would be
# the N+1th fibonacci number, leaving just the
# Nth fibonacci. …
- 8,592
3
votes
How-many-bonacci-like is this sequence?
Japt, 18 16 bytes
@ãX mx ¯J eUtX}a
Try it
Port of @lyxal's Vyxal answer.
Explanation:
@ }a # find the first positive integer X where:
ãX # all overlapped sections of len …
- 8,592
2
votes
How-many-bonacci-like is this sequence?
Uiua, 21 bytes
⍢(+1|¬≍↘¯1≡/+:⊙◫↘,,)1
Try it!
Starting with n = 1, increment until
there is no match of
dropping the last of
the row-wise sums of
the n-wise windows of the input
and dropping t …
- 8,592