login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004132 Modular postage stamp problem.
(Formerly M2450)
1
3, 5, 9, 13, 19, 21, 30, 35, 43, 51, 63, 67 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

REFERENCES

H. Haanpaa, Minimum sum and difference covers of abelian groups. J. Integer Seq. 7 (2004), no. 2, Article 04.2.6, 10 pp.

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..13.

Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, arXiv:1705.07444 [math.NT], May 2017. See p. 136.

R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs

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(10)

CROSSREFS

Sequence in context: A215909 A078735 A212530 * A207187 A065802 A245302

Adjacent sequences:  A004129 A004130 A004131 * A004133 A004134 A004135

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane

EXTENSIONS

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

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 02:14 EDT 2019. Contains 328335 sequences. (Running on oeis4.)