|
|
A090245
|
|
Maximum numbers of cards that would have no SET in an n-attribute version of the SET card game.
|
|
8
|
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Or, largest size of an n-dimensional capset (i.e., a subset of (Z/3Z)^n that does not contain any lines {a, a+r, a+2r}). - Terence Tao, Feb 20 2009
Or, size of maximal cap in the affine geometry AG(n+1,3). - N. J. A. Sloane, Oct 25 2014
|
|
LINKS
|
Benjamin Lent Davis and Diane Maclagan, The Card Game SET, The Mathematical Intelligencer, Vol. 25:3 (Summer 2003), pp. 33-40.
Pierre Jalinière, Le jeu Set, Images des Mathématiques, CNRS, 2013.
|
|
FORMULA
|
Asymptotically, a(n) = O(3^n/n) and a(n) > (2.21...)^n. - Terence Tao, Feb 20 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,more,nonn,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|