Problem 1190. Golomb's self-describing sequence (based on Euler 341)

• Created by James
• Appears in 3 groups

×

By solving this problem, you will make progress in the following group(s)

Sequences & Series I

• 14 Problems
• 88 Finishers

Project Euler IV

• 11 Problems
• 17 Finishers

Number theory

• 44 Problems
• 21 Finishers

Like (3)

Difficulty:

(44)

Rate

• Solve Later   
• Add To GroupÂ

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

• n =  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 …
• G(n) 1 2 2 3 3 4 4 4 5 5  5  6  6  6  6  …

Write a MATLAB script that will give you G(n) when given n.

Efficiency is key here, since some of the values in the test suite will take a while to calculate.

Solve

Solution Stats

45.2% Correct | 54.8% Incorrect

• 458 Solutions
• 169 Solvers

Last Solution submitted on Aug 05, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers169

Suggested Problems

• Binary numbers

  4651 Solvers

• Find the largest value in the 3D matrix

  1597 Solvers

• Remove the two elements next to NaN value

  675 Solvers

• Divisible by 4

  361 Solvers

• Volume Pillar

  1753 Solvers

More from this Author80

• Still more miles to go before I sleep

  48 Solvers

• How Far Can You Throw Something?

  46 Solvers

• Must be in the front row...

  138 Solvers

• Decimation

  270 Solvers

• Diophantine Equations (Inspired by Project Euler, problem 66)

  67 Solvers