freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md

---
id: 5900f3fe1000cf542c50ff11
title: 'Problem 146: Investigating a Prime Pattern'
challengeType: 5
forumTopicId: 301775
dashedName: problem-146-investigating-a-prime-pattern
---

# --description--

The smallest positive integer n for which the numbers n2+1, n2+3, n2+7, n2+9, n2+13, and n2+27 are consecutive primes is 10. The sum of all such integers n below one-million is 1242490.

What is the sum of all such integers n below 150 million?

# --hints--

`euler146()` should return 676333270.

```js
assert.strictEqual(euler146(), 676333270);
```

# --seed--

## --seed-contents--

```js
function euler146() {

  return true;
}

euler146();
```

# --solutions--

```js
// solution required
```