login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A289442
Number of abelian groups of order n which fail to meet a certain bound on the size of an unrestricted sumset.
0
0, 0, 0, 0, 1, 0, 0, 1, 2, 2, 3, 1, 2, 2, 2, 4, 5, 4, 6
OFFSET
2,9
REFERENCES
D. Manandhar, Decoding minimum h-fold restricted sumset size of a cyclic group. Research Papers in Mathematics, B. Bajnok, ed., Gettysburg College, Vol. 13 (2012).
LINKS
Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, arXiv:1705.07444 [math.NT], May 2017. See p. 113.
CROSSREFS
Sequence in context: A269978 A351258 A097028 * A092331 A299029 A200747
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Jul 07 2017
STATUS
approved