freeCodeCamp/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md

id	title	challengeType	forumTopicId	dashedName
5900f3e01000cf542c50fef3	Problem 116: Red, green or blue tiles	5	301742	problem-116-red-green-or-blue-tiles

--description--

A row of five black square tiles is to have a number of its tiles replaced with coloured oblong tiles chosen from red (length two), green (length three), or blue (length four).

If red tiles are chosen there are exactly seven ways this can be done.

If green tiles are chosen there are three ways.

And if blue tiles are chosen there are two ways.

Assuming that colors cannot be mixed there are 7 + 3 + 2 = 12 ways of replacing the black tiles in a row measuring five units in length. How many different ways can the black tiles in a row measuring fifty units in length be replaced if colors cannot be mixed and at least one colored tile must be used?

Note: This is related to Problem 117.

--hints--

redGreenBlueOne() should return 20492570929.

assert.strictEqual(redGreenBlueOne(), 20492570929);

--seed--

--seed-contents--

function redGreenBlueOne() {

  return true;
}

redGreenBlueOne();

--solutions--

// solution required