A004131 - OEIS

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.
(Formerly M2527)

1, 3, 6, 9, 13, 17, 24, 30, 36, 42

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

OFFSET

2,2

REFERENCES

P. Frankl et al., Projecting a finite point-set into a hyperplane, Ryukyu Math. J. 8 (1995), 27-35.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=2..11.

R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.

Sean A. Irvine, Example sets for a(2) to a(11)

CROSSREFS

Sequence in context: A235269 A004137 A080060 * A171514 A032782 A310157

Adjacent sequences: A004128 A004129 A004130 * A004132 A004133 A004134

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

EXTENSIONS

a(11) from Sean A. Irvine, Dec 07 2015

Definition edited by Rob Pratt, Jan 15 2021

STATUS

approved