The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A297351 Smallest number k such that, for any set S of k distinct nonzero residues mod p = prime(n), any residue mod p can be represented as a sum of zero or more distinct elements of S. 0
 1, 2, 3, 4, 6, 6, 7, 8, 9, 10, 10, 11, 12, 12, 13, 14, 15, 15, 16, 16, 16, 17 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS P. Erdős and H. Heilbronn, On the addition of residue classes mod p, Acta Arithmetica 9 (1964), 149-159. John E. Olson, An addition theorem modulo p, Journal of Combinatorial Theory 5 (1968), pp. 45-52. FORMULA For p = prime(n) > 3, sqrt(4p + 5) - 2 < a(n) <= sqrt(4p). The former bound is due to Erdős & Heilbronn and the latter to Olson. PROG (PARI) sumHitsAll(v, m)=my(u=, n); for(i=1, #v, n=v[i]; u=Set(concat(u, apply(j->(j+n)%m, u))); if(#u==m, return(1))); 0 a(n, p=prime(n))=for(s=sqrtint(4*p+2)-1, sqrtint(4*p)-1, forvec(v=vector(s, i, [1, p-1]), if(!sumHitsAll(v, p), next(2)), 2); return(s)); sqrtint(4*p) CROSSREFS Sequence in context: A075527 A325869 A154257 * A060019 A093451 A106006 Adjacent sequences:  A297348 A297349 A297350 * A297352 A297353 A297354 KEYWORD hard,more,nonn AUTHOR Charles R Greathouse IV, Jan 24 2018 EXTENSIONS a(13) from Charles R Greathouse IV, Jan 27 2018 a(14)-a(22) from Bert Dobbelaere, Apr 20 2019 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.

Last modified May 28 12:02 EDT 2020. Contains 334681 sequences. (Running on oeis4.)