Take an arbitrary starting point as input and create Recaman Sequence. Then find the 1, return its index.
For example: if n = 0 (default Recaman sequence)
seq = [0 1 3 6 2];
1 is in the second place.
if n = 10;
seq = [10 9 7 4 8 3 9 2 10 1 11 22 34 21];
1 is in the 10th place
Related Challenges :
- Recaman Sequence - I
- Recaman Sequence - II
- Recaman Sequence - III
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers278
Suggested Problems
-
Test if a Number is a Palindrome without using any String Operations
251 Solvers
-
378 Solvers
-
Integer Sequence - II : New Fibonacci
676 Solvers
-
1705 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2136 Solvers
More from this Author92
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Weirdly, the code that finishes the biggest problem in 0.6 sec on my machine will not finish on the server. Is 0.6 sec too long for the server, or is it an error? I'm not clever enough to understanding this, please help.
I met the problem too. Should we use some mathematical characters of the sequence to improve our codes? I'm not quite sure.