
Full text
... i=1 is called a Kentucky sequence if every ai (i ≥ 1) is the smallest positive integer that does not have a Kentucky legal decomposition using the elements {a1 , . . . , ai−1 }. From the definition of a Kentucky legal decomposition, the reader can see that the first five terms of the sequence must b ...
... i=1 is called a Kentucky sequence if every ai (i ≥ 1) is the smallest positive integer that does not have a Kentucky legal decomposition using the elements {a1 , . . . , ai−1 }. From the definition of a Kentucky legal decomposition, the reader can see that the first five terms of the sequence must b ...