Table read by antidiagonals upwards: a(n, k) is the minimum c such that n sets with k elements each can be constructed from numbers 1 to c (inclusive) such that any two sets have exactly 1 common element.
(history;
published version)
allocatedTable read by antidiagonals upwards: a(n, k) is the minimum c such that n sets with k elements each can be constructed from numbers 1 to c (inclusive) such that any two sets have exactly for1 Simoncommon Bohnenelement
<a href="https://github.com/Simonibo/dobble-generate/blob/master/values.xlsx">Extended table of values</a>
<a href="https://github.com/Simonibo/dobble-generate/tree/master/src">A Java program for generating the sequence</a>
<a href="https://math.stackexchange.com/questions/2216585/what-is-the-minimal-number-of-different-symbols-in-the-game-dobble">Further discussion and proof for the formula</a>
FORMULA
n<k+2: a(n)=kn-(n(n-1))/2.
EXAMPLE
Top-left corner of the array:
1 1 1 1 1 1 ...
2 3 3 5 6 7 ...
3 5 6 6 7 7 ...
4 7 9 10 10 11 ...
5 9 12 14 15 15 ...
6 11 15 18 20 21 ...
: : : : : : '.
For n=3 and k=3 the best possible solution is 6, the three sets are: