freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md

---
id: 5900f44e1000cf542c50ff60
challengeType: 5
videoUrl: ''
title: 问题225：Tribonacci非除数
---

## Description
<section id="description">序列1,1,1,3,5,9,17,31,57,105,193,355,653,1201 ......由T1 = T2 = T3 = 1和Tn = Tn-1 + Tn定义-2 + Tn-3。 <p>可以证明27不会划分该序列的任何项。实际上，27是具有该属性的第一个奇数。 </p><p>找到不分割上述序列的任何项的第124个奇数。 </p></section>

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

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler225()</code>应该返回2009年。
    testString: assert.strictEqual(euler225(), 2009);

```

</section>

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

<div id='js-seed'>

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

euler225();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>