OFFSET
1,2
COMMENTS
A basis 1 = b_1 < b_2 ... < b_n is admissible if all the values 1 <= x <= b_n is obtainable as a sum of at most h (not necessarily distinct) numbers in the basis.
REFERENCES
R. K. Guy, Unsolved Problems in Number Theory, C12.
LINKS
R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis, Two new techniques for computing extremal h-bases A_k, Comp J 36(2) (1993) 117-126
Erich Friedman, Postage stamp problem
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.
S. Mossige, Algorithms for Computing the h-Range of the Postage Stamp Problem, Math. Comp. 36 (1981) 575-582
CROSSREFS
KEYWORD
hard,more,nonn
AUTHOR
Yogy Namara (yogy.namara(AT)gmail.com), Nov 12 2009
EXTENSIONS
Terms a(1) to a(12) verified and new terms a(13) and a(14) added by Herbert Kociemba, Jul 14 2010
STATUS
approved