login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003142 Largest subset of 3 X 3 X ... X 3 cube (in n dimensions) with no 3 points collinear.
(Formerly M1611)
2
0, 2, 6, 16, 43, 124, 353 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The D. H. J. Polymath collective found a(5) and a(6) and gives the bound a(n) >= (2 + o(1))binomial(n, i)*2^i for any i (and note that this is maximized by i near 2n/3). - Charles R Greathouse IV, Jun 11 2013

REFERENCES

V. Chvatal, Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math. 4 (1973), 305-337.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=0..6.

V. Chvatal, Edmonds polytopes and a hierarchy of combinatorial problems, Discr. Math. 4 (1973) no 4, 305-337.

D. H. J. Polymath, Density Hales-Jewett and Moser numbers, arXiv:1002.0374 [math.CO]

Index entries for sequences related to tic-tac-toe

CROSSREFS

Sequence in context: A244399 A027994 A027068 * A118041 A105073 A002605

Adjacent sequences:  A003139 A003140 A003141 * A003143 A003144 A003145

KEYWORD

nonn,hard,more

AUTHOR

N. J. A. Sloane.

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 25 12:08 EDT 2017. Contains 287027 sequences.