is the number of times that occurs in the sequence, starting with , and with the property that for each is the unique integer which makes it possible to satisfy the condition. The sequence starts off as
Golomb's sequence is a non-decreasing integer sequence where
How many times does 50 appear in this sequence?
Image credit: Wikipedia Vic201401
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This is a Gollomb's sequence
The answer is hidden inside it only.
How many times does a number occur is only determined by going to that number in this sequence. For example, how many times 2 has to come
1 , 2 , 2 And hence 2 times
In the same way the sequence will be
1,2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9 and so on
Therefore, at 50th term, it will be 13, so the answer is 1 3
P.S. or Extra Knowledge - As n → ∞ , a ( n ) → φ 2 − φ n φ − 1
[This is just for knowledge, I would urge someone to make a question on this]