|
|
A004079
|
|
a(n) = maximal m such that an m X n Florentine rectangle exists.
|
|
0
|
|
|
1, 2, 2, 4, 4, 6, 6, 7, 8, 10, 10, 12
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
CRC Handbook of Combinatorial Designs, 1996, p. 483.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|