

A167025


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.


0



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, 25, 26, 28, 28, 30, 33, 33, 35, 35, 37, 37, 39, 40, 41, 45, 45, 47, 47, 49, 51, 51, 52, 53, 58
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,5


COMMENTS

Elements of the set can be used more than once.


LINKS



EXAMPLE

For n=15, the solution is (1,4,5) which sums to 10.


CROSSREFS



KEYWORD

nonn,more


AUTHOR

Matt Shoemaker, Oct 27 2009


STATUS

approved



