A084193 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

0,2

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.

LINKS

Table of n, a(n) for n=0..70.

Index to sequences related to the Postage Stamp Problem

EXAMPLE

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, ...