Problem 43179. Red and green towers
Frankie has a large number of wooden cubes, painted in red and green. He is building little towers with his cubes, by stacking them on top of each other.
He got bored after a while, so he introduced a rule: two red cubes may not be touching (see image).
Given n (the maximum number of cubes in a tower), determine the number m of different towers that Frankie can build.
Example: for n = 2, he can make 5 towers, so m=5:
- [Red];
- [Green];
- [Red, Green];
- [Green, Red];
- [Green, Green].
You may assume that the input is an integer greater than zero.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers22
Suggested Problems
-
471 Solvers
-
Basic electricity in a dry situation
548 Solvers
-
Convert from Base 10 to base 5
253 Solvers
-
Check that number is whole number
3838 Solvers
-
1233 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!