|
|
A280537
|
|
Maximum number of points that can be selected from an n X n X n grid so that no four of them are in a plane.
|
|
2
|
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Terms up to a(6) were found by exhaustive search. a(7) and a(8) are based on extensive numerical evidence.
Currently (January 2017) known lower bounds for the next terms are a(9)>=23, a(10)>=26, a(11)>=28, a(12)>=30, a(13)>=32, a(14)>=35, a(15)>=36, a(16)>=38, a(17)>=42.
|
|
REFERENCES
|
Walter Möhres, Exhaustive Search for the 6x6x6 "No Four in Plane Problem". Private communication, September 2016.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|