---
id: 5900f5271000cf542c51003a
challengeType: 5
title: 'Problem 443: GCD sequence'
videoUrl: ''
localeTitle: 'Problema 443: sequência do GCD'
---

## Description
<section id="description"> Seja g (n) uma sequência definida da seguinte forma: g (4) = 13, g (n) = g (n-1) + mdc (n, g (n-1)) para n&gt; 4. <p> Os primeiros valores são: </p><pre> <code>n4567891011121314151617181920... g(n)1314161718272829303132333451545560...</code> </pre><p> Você está dado que g (1 000) = 2524 e g (1 000 000) = 2624152. </p><p> Encontre g (1015). </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler443()</code> deve retornar 2744233049300770.
    testString: 'assert.strictEqual(euler443(), 2744233049300770, "<code>euler443()</code> should return 2744233049300770.");'

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler443() {
  // Good luck!
  return true;
}

euler443();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>