%I #7 Mar 09 2018 21:24:48
%S 0,1,1,1,3,3,3,4,6,6,7,8,8,10,10,10,13,13,14,17,17,17,19,20,20,24,25,
%T 25,26,28,28,30,33,33,35,35,37,37,39,40,41,45,45,47,47,49,51,51,52,53,
%U 58
%N Minimum sum of a set of positive integers such that every positive integer <= n is the sum of 1 to 3 elements of the set.
%C Elements of the set can be used more than once.
%e For n=15, the solution is (1,4,5) which sums to 10.
%Y Cf. A165885.
%K nonn,more
%O 0,5
%A Matt Shoemaker, Oct 27 2009