A196416 - OEIS

A196416

Table read by antidiagonals: V(n,m) = solution to postage stamp problem with n stamps in set, m stamps on letter.

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 5, 4, 1, 1, 5, 8, 9, 5, 1, 1, 6, 11, 16, 13, 6, 1, 1, 7, 15, 27, 25, 17, 7, 1, 1, 8, 19, 36, 45, 37, 21, 8, 1, 1, 9, 24, 53, 72, 71, 53, 27, 9, 1, 1, 10, 29, 70, 115, 127, 109, 71, 33, 10, 1

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

OFFSET

0,5

COMMENTS

Given n, m, the postage stamp problem is to choose a set of n nonnegative integers such that the sums of m or fewer of these integers can realize the numbers 1, 2, ..., N-1, where N is as large as possible. V(n,m) denotes the value of N.

LINKS

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

W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

EXAMPLE

Array begins:

m\n 0 1 2 3 4 5 6 ...

---------------------

0...1 1 1 1 1 1 1 ...

1...1 2 3 4 5 6 7 ...

2...1 3 5 9 13 17 21 ...

3...1 4 8 16 25 37 53 ...

4...1 5 11 27 45 71 109 ...