A084193 Array read by antidiagonals: T(k,n) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1).

1, 2, 2, 3, 4, 3, 4, 7, 8, 4, 5, 10, 15, 12, 5, 6, 14, 26, 24, 16, 6, 7, 18, 35, 44, 36, 20, 7, 8, 23, 52, 71, 70, 52, 26, 8, 9, 28, 69, 114, 126, 108, 70, 32, 9, 10, 34, 89, 165, 216, 211, 162, 93, 40, 10, 11, 40, 112, 234, 345, 388, 336, 228, 121, 46, 11, 12, 47, 146, 326, 512

Offset: 0

Author

N. J. A. Sloane, Jun 20 2003

Keywords

• nonn
• easy
• nice
• tabl

Comments

Fred Lunnon [W. F. Lunnon] defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given in this sequence and in A001208, A001209, A001210, A001211, A001212, ... are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

Examples

			Array begins:
   1,   2,   3,   4,   5,   6,   7,   8,   9,  10,  11, ...
   2,   4,   8,  12,  16,  20,  26,  32,  40,  46, ...
   3,   7,  15,  24,  36,  52,  70,  93, 121, ...
   4,  10,  26,  44,  70, 108, 162, 228, ...
   5,  14,  35,  71, 126, 211, 336, ...
   6,  18,  52, 114, 216, 388, ...
   7,  23,  69, 165, 345, ...
   8,  28,  89, 234, ...
   9,  34, 112, ...
  10,  40, ...
  11, ...
  ...
		

Links

• Index to sequences related to the Postage Stamp Problem

Crossrefs

A084192 gives transposed array. Rows and columns give rise to A014616, A001208, A001209, A001210, A001211, A053346, A053348, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A075060.

Extensions

Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Jun 26 2003

Comments corrected by Shawn Pedersen, Apr 17 2012