%I #7 Oct 09 2013 11:21:55
%S 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,
%T 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,
%U 2,2,2,2,2,2,2,1,1,1,1,1,6
%N Alternative version of A229874 with tuple values in increasing order.
%C An enumeration of all sorted k-tuples containing positive integers.
%C 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.
%C This sequence is a flattening of that process.
%C Other properties of this sequence are as A229874.
%H Carl R. White, <a href="/A229897/b229897.txt">Rows n = 1..256 of irregular triangle, flattened</a>
%H Carl R. White, <a href="/A229897/a229897.txt">Tabular layout of the sequence showing the k-tuples as they occur</a>
%e Sequence begins (1), (2), (1,1), (3), (1,2), (2,2), (1,1,1), (4), etc.
%Y Cf. A001057. All tuples, not just sorted: A229873. Alternative version: A229874
%K nonn,tabf
%O 1,2
%A _Carl R. White_, Oct 04 2013