# 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:

n | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |

f(n) | 1 | 2 | 2 | 3 | 3 | 4 | 4 | 4 | 5 | 5 | 5 | 6 |

Find the 123456th term of the sequence.