login
A229897
Alternative version of A229874 with tuple values in increasing order.
3
1, 2, 1, 1, 3, 1, 2, 2, 2, 1, 1, 1, 4, 1, 3, 2, 3, 3, 3, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 5, 1, 4, 2, 4, 3, 4, 4, 4, 1, 1, 3, 1, 2, 3, 2, 2, 3, 1, 3, 3, 2, 3, 3, 3, 3, 3, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 6
OFFSET
1,2
COMMENTS
An enumeration of all sorted k-tuples containing positive integers.
Begin with the 1-tuple (1), and then reading from the beginning of the list of k-tuples append to the list (n+1) if the k-tuple read is a 1-tuple and for all cases, append the (k+1)-tuples (1,n,...), (2,n,...), ..., (n,n,...), where n is the first element of the k-tuple that was read.
This sequence is a flattening of that process.
Other properties of this sequence are as A229874.
EXAMPLE
Sequence begins (1), (2), (1,1), (3), (1,2), (2,2), (1,1,1), (4), etc.
CROSSREFS
Cf. A001057. All tuples, not just sorted: A229873. Alternative version: A229874
Sequence in context: A337259 A037034 A340056 * A343796 A380471 A139462
KEYWORD
nonn,tabf
AUTHOR
Carl R. White, Oct 04 2013
STATUS
approved