Red and green towers - MATLAB Cody - MATLAB Central

Problem 43179. Red and green towers

Difficulty:Rate

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:

  1. [Red];
  2. [Green];
  3. [Red, Green];
  4. [Green, Red];
  5. [Green, Green].

You may assume that the input is an integer greater than zero.

Solution Stats

86.49% Correct | 13.51% Incorrect
Last Solution submitted on Sep 01, 2025

Problem Comments

Solution Comments

Show comments
AI Is Transforming Engineering Workflows
It’s an honor to deliver the keynote at MATLAB EXPO 2025. I'll...
0
MATLAB EXPO 2025 Registration is Now Open! November 12 – 13, 2025
Registration is now open for MathWorks annual virtual event MATLAB EXPO 2025...
0

Problem Recent Solvers24

Suggested Problems

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!