%I #32 Apr 08 2016 13:20:47
%S 1,2,4,7,12,18,26,35,45,56,73,86,107,128,152,178,200,217,247,284,334,
%T 357,373,426,481,493,554
%N a(n) = A003022(n)+1 with a(1)=1.
%C Since A003022 is the most important sequence dealing with Golomb rulers, it seems best to define this sequence in terms of that one.
%C Original name was: Maximum label within a minimal labeling of 2 identical n-sided dice yielding the most possible sums. For example, two hexahedra labeled (1, 3, 8, 14, 17, 18) yield the 21 possible sums 2, 4, 6, 9, 11, 15, 16, 17, 18, 19, 20, 21, 22, 25, 26, 28, 31, 32, 34, 35, 36. No more sums can be obtained by different labelings, and no labeling with labels < 18 yields 21 possible sums. Therefore a(6) = 18.
%C Bounded above by A005282. - _James Wilcox_, Jul 27 2013
%C Minimum greatest integer in a set of n positive integers with all the differences between any two of its elements being different. - _Javier Múgica_, Jul 31 2015
%Y Cf. A003022.
%Y Column k=2 of array A227588.
%K nonn,more
%O 1,2
%A _Jens Voß_, Jul 17 2013
%E More terms from _James Wilcox_, Jul 27 2013
%E Entry revised by _N. J. A. Sloane_, Apr 08 2016