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!)
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
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.
CROSSREFS
Sequence in context: A215909 A078735 A212530 * A207187 A359185 A065802
KEYWORD
nonn,more
AUTHOR
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 06:52 EDT 2024. Contains 371920 sequences. (Running on oeis4.)