Problem 44836. Iccanobif numbers 1
There are a lot of problems in Cody that deal with Fibonacci numbers (1, 1, 2, 3, 5, 8, 13, 21 etc...) so let's turn things around a bit. Literally. This problem deals with the Iccanobif sequence. Instead of adding the previous two numbers in the sequence, reverse the digits of the previous two numbers and add those together to get the next number in the sequence.
It starts out exactly the same as the Fibonacci (1, 1, 2, 3, 5, 8, 13) as all of the one digit numbers equal themselves when reversed. However, instead of 8+13=21 for the next term, reverse the digits in 13 to get 31. The next term is now 8+31, or 39. The next term after that is 31+93 (13 and 39 reversed) to get 124, and so on. Unlike the starndard Fibonacci sequence, the Iccanobif sequence can actually decrease in value between terms.
You will be given a number, and you will be asked to calculate that term in the Iccanobif sequence.
!Kcul doog
Solution Stats
Problem Comments
-
1 Comment
I like the way James present a problem: educatiive and interesting.
Solution Comments
Show commentsProblem Recent Solvers60
Suggested Problems
-
15811 Solvers
-
Replace NaNs with the number that appears to its left in the row.
2992 Solvers
-
Generate a random matrix A of (1,-1)
322 Solvers
-
Convert a Cell Array into an Array
1876 Solvers
-
579 Solvers
More from this Author80
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!