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!)
A292773 a(n) is the least integer m such that any choice of m elements in (Z_3)^n contains a subset of size 3 whose sum is zero. 0
5, 9, 19, 41, 91, 225 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Y. Edel, C. Elsholtz, A. Geroldinger, S. Kubertin and L. Rackham, Zero-sum problems in finite abelian groups and affine caps, Quarterly Journal of Mathematics 58 (2), 159-186.
Christian Elsholtz, Lower bounds for multidimensional zero sums, Combinatorica 24.3 (2004): 351-358.
H. Harborth, Ein Extremalproblem für Gitterpunkte, J. Reine Angew. Math. 262 (1973), 356-360.
Aaron Potechin, Maximal caps in AG (6, 3), Designs, Codes and Cryptography volume 46, pages 243-259 (2008).
FORMULA
a(n) = 2*A090245(n) + 1, (follows from Harborth, Hilfssatz 3). - C. Elsholtz, Oct 04 2021
CROSSREFS
Cf. A090245.
Sequence in context: A060161 A282730 A082674 * A228338 A309731 A253951
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Sep 30 2017
EXTENSIONS
a(6), based on Potechin's paper, added by C. Elsholtz, Oct 04 2021
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 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)