Postage stamp problem: largest m such that there exists an n-subset S of nonnegative integers such that 1,...,m can be expressed as a sum of two distinct elements of S.
A004129
Postage stamp problem: largest m such that there exists an n-subset S of nonnegative integers such that 1,...,m can be expressed as a sum of two distinct elements of S.
Terms
- a(0) =1a(1) =3a(2) =6a(3) =9a(4) =13a(5) =17a(6) =22a(7) =27a(8) =33a(9) =40a(10) =47a(11) =56a(12) =65a(13) =74a(14) =83a(15) =94a(16) =105
External references
- oeis: A004129