Golomb's self describing sequence

Computer Science Level 4

Solomon Golomb’s self-describing sequence \(f(1), f(2), f(3), . . . \) is the only non-decreasing sequence of positive integers with the property that it contains exactly f(k) occurrences of k for each k.Read more about it here A few moment’s thought reveals that the sequence must begin as follows:


Find the 123456th term of the sequence.


Problem Loading...

Note Loading...

Set Loading...