<section id="description">
<p>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</p><p>n123456789101112131415…G(n)122334445556666…</p>
<p>You are given that G(103) = 86, G(106) = 6137.
You are also given that ΣG(n3) = 153506976 for 1 ≤ n &#x3C; 103.</p>
<p>Find ΣG(n3) for 1 ≤ n &#x3C; 106.</p>
</section>

function euler341() {
  // Good luck!
  return true;
}

euler341();


index

Задача 341: самоописательная последовательность Голомба

Problem 341: Golomb's self-describing sequence

<code>euler341()</code> should return 56098610614277016.