cp's OEIS Frontend

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 (...,n,1), (...,n,2), ..., (...,n,n), where n is the last element of the k-tuple that was read.

This sequence is a flattening of that process.

Each tuple contains a unique group of integers, meaning that the sequence of tuples is an enumeration of all finite sets of positive integers.

Determining a tuple's parent is as simple as removing the last element in the case of k-tuples where k>2 and by subtracting 1 from the only element in the case of 1-tuples. E.g., (7,5,3,2,1)'s ancestry is (7,5,3,2), (7,5,3), (7,5), (7), (6), (5), (4), (3), (2), (1).

Tuples are in ordered so that the rightmost element increases in value from sibling to sibling, resembling place-value notation. This has the side effect of putting the values within the tuples in the reverse of the usual sort order. The alternative version of this sequence with tuple values in increasing order can be found in A229897.

Remarkably, the k-tuple sizes can be found in A124736 - k repeated C(n,k-1) times - and relatedly, the first appearance of n in this sequence is at position 2^(n-1)+1.

Number k of elements to read from A229873 to obtain the next k-tuple.