|
|
A179310
|
|
The smallest number that has more copies of some digit than all previous terms of the sequence put together.
|
|
1
|
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 22, 33, 44, 55, 66, 77, 88, 99, 100, 1111, 2222, 3333, 4444, 5555, 6666, 7777, 8888, 9999, 10000, 22222222, 33333333, 44444444, 55555555, 66666666, 77777777, 88888888, 99999999, 100000000, 1111111111
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
For each natural number taken in order, we consider if we can make it using digits from as many of the previous terms as we like. If we cannot, we add it to the sequence and add its digits to the 'pool' we have for making subsequent numbers.
|
|
LINKS
|
|
|
EXAMPLE
|
This sequence is the same as A179309 up to 100. After that, we can make any three-digit number because we have had at least three of each digit so far. We can make 1000 because we have already had three 0's (in 10 and 100). So the next term is 1111 because we have only seen three 1's so far.
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|