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”).
%I #12 Jul 07 2017 11:42:49
%S 0,0,0,0,1,0,0,1,2,2,3,1,2,2,2,4,5,4,6
%N Number of abelian groups of order n which fail to meet a certain bound on the size of an unrestricted sumset.
%D 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).
%H Bela Bajnok, <a href="https://arxiv.org/abs/1705.07444">Additive Combinatorics: A Menu of Research Problems</a>, arXiv:1705.07444 [math.NT], May 2017. See p. 113.
%K nonn,more
%O 2,9
%A _N. J. A. Sloane_, Jul 07 2017