← Complete problem index

PROJECT EULER · #0341

Golomb's Self-describing Sequence

Statement only · UnsolvedOriginal problem ↗

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

n123456789101112131415G(n)122334445556666

You are given that G(103)=86, G(106)=6137.
You are also given that G(n3)=153506976 for 1n<103.

Find G(n3) for 1n<106.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.