id:A004079 - OEIS Search Results

Search: id:A004079

Displaying 1-1 of 1 results found.

page 1

a(n) = maximal m such that an m X n Florentine rectangle exists.

+0
1

1, 2, 2, 4, 4, 6, 6, 7, 8, 10, 10, 12 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`CRC Handbook of Combinatorial Designs, 1996, p. 483.`
	CROSSREFS	`Sequence in context: A070320 A124195 A079584 this_sequence A096494 A116568 A061106` `Adjacent sequences: A004076 A004077 A004078 this_sequence A004080 A004081 A004082`
	KEYWORD	`nonn,hard`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.