OFFSET
1,2
LINKS
Walter Gilbert, Chessboard quartering; includes generating program.
FORMULA
No formula known. However, the subset of solutions consisting of "tiles" with minimum edge lengths from a corner of the board to the center is A001700.
This sequence can be computed by counting paths in a graph. To compute the n-th term a graph with n X (n-1) vertices is required. Each graph vertex corresponds to 4 intersections between grid lines on the chessboard and graph edges correspond to ways of cutting the board along the grid lines. Frontier (matrix-transfer) graph path counting methods can then be applied to the graph to get the actual count. - Andrew Howroyd, Apr 18 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Walter Gilbert (Walter(AT)Gilbert.net), Oct 28 2001
EXTENSIONS
a(7)-a(8) from Juris Cernenoks, Feb 27 2013
a(9)-a(14) from Andrew Howroyd, Apr 18 2016
STATUS
approved