Consider the following sequence of numbers:
Each row "describes" the previous row.
For example, the first row has one . The next row is .
The second row has two . The next row is .
The third row has one and one . The next row is .
The fourth row has one , one , and two . The next row is .
Consider each unique digit in the row of this sequence. What is the sum of these digits?
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.
The next number in the sequence is 3 1 2 2 1 1 . Every number following this one must contain a 1 , a 2 , and a 3 at least once to properly describe the previous row. However, I argue that no digit greater than 3 can appear in the sequence.
Assume that a digit greater than or equal to 4 is in the sequence. This implies that there was a number at some point with at least 4 repeating digits in a row. Let n be the first such number. If this digit is X , then n = . . . A X X X X B . . . where A and B could or could not be X . What could the previous number have been?
We can divide n into a series of descriptions, with each description containing a quantity value followed by a digit value. Currently, there have never been 1 0 or more of a digit in a row, so a description will always have exactly 2 digits. Depending on the location of A X X X X B in the number, the descriptions can be A X , X X , X B or X X , X X . In both cases, the digit value X appears twice in a row (in red). Both of these situations are impossible since the same digit value cannot appear in two consecutive descriptions (if this did happen, they should be merged into one description). This is a contradiction, so 4 digits in a row cannot appear in the sequence.
The 2 0 1 8 t h row contains only 1 s , 2 s , and 3 s , so the sum of the unique digits is 1 + 2 + 3 = 6