freeCodeCamp

1.0 KiB

Raw Blame History

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

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

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

Instructions

Tests

tests:
  - text: <code>euler341()</code> should return 56098610614277016.
    testString: assert.strictEqual(euler341(), 56098610614277016);

Challenge Seed

function euler341() {

  return true;
}

euler341();

Solution

// solution required

1.0 KiB Raw Blame History