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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%I M2527 #26 Jan 15 2021 16:48:43

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

%N 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.

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

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

%H R. L. Graham and N. J. A. Sloane, <a href="http://neilsloane.com/doc/RLG/073.pdf">On Additive Bases and Harmonious Graphs</a>, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.

%H Sean A. Irvine, <a href="/A004131/a004131.txt">Example sets for a(2) to a(11)</a>

%K nonn

%O 2,2

%A _N. J. A. Sloane_

%E a(11) from _Sean A. Irvine_, Dec 07 2015

%E Definition edited by _Rob Pratt_, Jan 15 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)