A001210 a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.
5, 16, 36, 70, 126, 216, 345, 512, 797, 1055, 1475, 2047, 2659, 3403, 4422, 5629, 6865, 8669, 10835, 12903, 15785, 18801, 22456, 26469, 31108, 36949, 42744, 49436, 57033, 66771, 75558, 86303, 96852, 110253, 123954, 140688, 158389, 178811, 197293, 223580
Offset: 1
Keywords
References
- R. K. Guy, Unsolved Problems in Number Theory, C12.
- N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Links
- Robert Price, Table of n, a(n) for n = 1..67
- 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.
- M. F. Challis and J. P. Robinson, Some Extremal Postage Stamp Bases, J. Integer Seq., 13 (2010), Article 10.2.3. [From John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010]
- Erich Friedman, Postage stamp problem
- W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.
- Eric Weisstein's World of Mathematics, Postage stamp problem
Crossrefs
Extensions
Terms up to a(29) from Challis added by R. J. Mathar, Apr 01 2006
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(30)-a(67) from Challis and Robinson added by Robert Price, Jul 19 2013
Comments