Problem 341: Golomb's self-describing sequence

FCC link

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 < 103.

Find ΣG(n3) for 1 ≤ n < 106.

Test

Boilerplate code

Console output

Shortcuts on this page

Use Cmd instead of Ctrl if you're on a Mac.

`g`	Focus editor
`Ctrl`-`Enter`	Run the test with current code
`Ctrl`-`Shift`-`K`	Reset the editor
`Ctrl`-`Shift`-`L`	Clear console output
`Ctrl`-`Shift`-`X`	Show the solution
`[`	Previous challenge
`]`	Next challenge
`T`	Back to top page
`?`	Show this dialog
`ESC`	Hide this dialog
`Shift`-`ESC`	Blur focus from editor