A381894 Lexicographically earliest sequence of positive integers such that a(n) is the length of the n-th run of consecutive, equal terms and no two runs have the same sum.
1, 2, 2, 1, 1, 3, 5, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 5, 5, 6, 6, 3, 3, 3, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 11, 11, 11, 13, 13, 13, 15, 15, 15, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9
Offset: 1
Keywords
Examples
a(6) = 3 because the 4th run must have length a(4) = 1, and the potential runs 1 and 2 have the same sum as a run already in the sequence (namely 1 and 1,1). So a(6) = 3 since no run has appeared with a sum of 3 thus far.
Links
- Neal Gersh Tolunsky, Table of n, a(n) for n = 1..10000