TOPICS
Search

Number Picking


Number picking is the problem of counting the distinct sums obtained by choosing n balls without replacement from 2n balls labeled 1 through 2n, where n is a positive integer. The sums run through every integer from n(n+1)/2 to n(3n+1)/2, so their number is n^2+1. For n=1, 2, 3, ..., the counts are 2, 5, 10, 17, 26, ... (OEIS A002522).


See also

Number Guessing, Real Number Picking

Explore with Wolfram|Alpha

References

Sloane, N. J. A. Sequence A002522 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Number Picking

Cite this as:

Weisstein, Eric W. "Number Picking." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/NumberPicking.html

Subject classifications