freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.spanish.md

---
id: 5900f4311000cf542c50ff44
challengeType: 5
title: 'Problem 197: Investigating the behaviour of a recursively defined sequence'
videoUrl: ''
localeTitle: 'Problema 197: investigar el comportamiento de una secuencia definida recursivamente'
---

## Description
<section id="description"> Dada la función f (x) = ⌊230.403243784-x2⌋ × 10-9 (⌊ ⌋ es la función de piso), la secuencia un está definida por u0 = -1 y un + 1 = f (un). <p> Encuentra un + un + 1 para n = 1012. Da tu respuesta con 9 dígitos después del punto decimal. </p></section>

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

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler197()</code> debe devolver 1.710637717.
    testString: 'assert.strictEqual(euler197(), 1.710637717, "<code>euler197()</code> should return 1.710637717.");'

```

</section>

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

<div id='js-seed'>

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

euler197();

```

</div>



</section>

## Solution
<section id='solution'>

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