Modular postage stamp problem: largest m such that there exists an n-subset S of nonnegative integers such that 0,...,m-1 can be expressed as a mod-m sum of two distinct elements of S.
A004131
Modular postage stamp problem: largest m such that there exists an n-subset S of nonnegative integers such that 0,...,m-1 can be expressed as a mod-m sum of two distinct elements of S.
Terms
- a(0) =1a(1) =3a(2) =6a(3) =9a(4) =13a(5) =17a(6) =24a(7) =30a(8) =36a(9) =42
External references
- oeis: A004131