A167814 Number of admissible basis in the postage stamp problem for n denominations and h = 7 stamps.

1, 7, 105, 3407, 217997, 24929035, 4863045067

Offset: 1

Author

Yogy Namara (yogy.namara(AT)gmail.com), Nov 12 2009

Keywords

• hard
• more
• nonn

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

Other enumerations with different parameters: A167809 (h = 2), A167810 (h = 3), A167811 (h = 4), A167812 (h = 5), A167813 (h = 6), A167814 (h = 7).

For h = 2, cf. A008932.