freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md

---
id: 5900f4c11000cf542c50ffd3
title: 'Problem 341: Golomb''s self-describing sequence'
challengeType: 5
forumTopicId: 302000
dashedName: problem-341-golombs-self-describing-sequence
---

# --description--

The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are

n123456789101112131415…G(n)122334445556666…

You are given that G(103) = 86, G(106) = 6137. You are also given that ΣG(n3) = 153506976 for 1 ≤ n &lt; 103.

Find ΣG(n3) for 1 ≤ n &lt; 106.

# --hints--

`euler341()` should return 56098610614277016.

```js
assert.strictEqual(euler341(), 56098610614277016);
```

# --seed--

## --seed-contents--

```js
function euler341() {

  return true;
}

euler341();
```

# --solutions--

```js
// solution required
```
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00			`---`
			`id: 5900f4c11000cf542c50ffd3`
fix(curriculum): quotes in tests (#18828) * fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown 2018-10-20 21:02:47 +03:00			`title: 'Problem 341: Golomb''s self-describing sequence'`
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`challengeType: 5`
fix(curriculum): Added forumTopicId to remaining 1200 challeng… (#36558) 2019-08-05 09:17:33 -07:00			`forumTopicId: 302000`
feat(curriculum): restore seed + solution to Chinese (#40683) * feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com> 2021-01-13 03:31:00 +01:00			`dashedName: problem-341-golombs-self-describing-sequence`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00			`---`

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`# --description--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
			`n123456789101112131415…G(n)122334445556666…`

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`You are given that G(103) = 86, G(106) = 6137. You are also given that ΣG(n3) = 153506976 for 1 ≤ n < 103.`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`Find ΣG(n3) for 1 ≤ n < 106.`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`# --hints--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`euler341()` should return 56098610614277016.
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			```js
			`assert.strictEqual(euler341(), 56098610614277016);`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00			```

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`# --seed--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`## --seed-contents--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
			```js
			`function euler341() {`
fix: remove Good luck! comment from challenge seed code (#39575) 2020-09-15 09:57:40 -07:00
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00			`return true;`
			`}`

			`euler341();`
			```

Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format. 2020-11-27 19:02:05 +01:00			`# --solutions--`
feat(challenge-md): Add initial markdown challenge files 2018-09-30 23:01:58 +01:00
			```js
			`// solution required`
			```