Golomb's self-describing sequence (based on Euler 341) - MATLAB Cody - MATLAB Central

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

Difficulty:
(146)
Rate

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

44.89% Correct | 55.11% Incorrect
Last Solution submitted on Apr 10, 2025

Problem Comments

Solution Comments

Show comments
Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025
...
Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers164

Suggested Problems

More from this Author80

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page