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.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers181
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5791 Solvers
-
Maximum running product for a string of numbers
2252 Solvers
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
2078 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1385 Solvers
-
17576 Solvers
More from this Author80
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!