---
id: 5900f3e21000cf542c50fef4
title: 'Problem 117: Red, green, and blue tiles'
challengeType: 1
forumTopicId: 301743
dashedName: problem-117-red-green-and-blue-tiles
---

# --description--

Using a combination of black square tiles and oblong tiles chosen from: red tiles measuring two units, green tiles measuring three units, and blue tiles measuring four units, it is possible to tile a row measuring five units in length in exactly fifteen different ways.

<img alt="Possible ways of placing red, green and blue oblongs on a row with length of five units" src="https://cdn.freecodecamp.org/curriculum/project-euler/red-green-and-blue-tiles.png" style="background-color: white; padding: 10px; display: block; margin-right: auto; margin-left: auto; margin-bottom: 1.2rem;">

How many ways can a row measuring fifty units in length be tiled?

**Note**: This is related to Problem 116.

# --hints--

`redGreenBlueTilesTwo()` should return `100808458960497`.

```js
assert.strictEqual(redGreenBlueTilesTwo(), 100808458960497);
```

# --seed--

## --seed-contents--

```js
function redGreenBlueTilesTwo() {

  return true;
}

redGreenBlueTilesTwo();
```

# --solutions--

```js
// solution required
```
