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 very tough problem. oeis is the key to solving this problem. Every pattern in oeis is coded with a 6-digit number. So, if we search for A000001, A011001 and etc..., we find that the right hand side numbers are obtained by concentrating the first three terms of the sequence. So, searching for A 1 1 1 1 0 0 in oeis gives 4 , 8 , 1 1 2 as the first three terms. So, the answer is 4 8 1 1 2 .