114670

Appears in sequences

• a(0) = 0. a(n) is the number of repeating sums in the collection of all sums of any k elements in [a(0), ... a(n-1)] chosen without replacement for 2 <= k <= n.at n=17A247188
• Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the sum of distinct products Product_{j=1..k} b_j with 1 <= b_j<= n.at n=48A321163