Problem 1190. Golomb's self-describing sequence (based on Euler 341)
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 commentsProblem Recent Solvers151
Suggested Problems
-
Find the numeric mean of the prime numbers in a matrix.
8856 Solvers
-
4208 Solvers
-
340 Solvers
-
Matrix with different incremental runs
485 Solvers
-
Number of Even Elements in Fibonacci Sequence
1261 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!