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:
No rating
|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.77% Correct | 55.23% Incorrect
Last Solution submitted on Feb 23, 2025

Problem Comments

Solution Comments

Show comments

Group

Computer Games III Image
Computer Games III
  • 13 Problems
  • 2 Finishers

Problem Recent Solvers163

Community Treasure Hunt

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

Start Hunting!
Go to top of page