id:A079326 - OEIS Search Results

Search: id:A079326

Displaying 1-1 of 1 results found.

page 1

a(n) = the largest number m such that if m monominoes are removed from an n X n square then an L-triomino must remain.

+0
16

1, 2, 7, 9, 17, 20, 31, 35, 49, 54, 71, 77, 97, 104, 127, 135, 161, 170, 199, 209, 241, 252, 287, 299, 337, 350, 391, 405, 449, 464, 511, 527, 577, 594, 647, 665, 721, 740, 799, 819, 881, 902, 967, 989, 1057, 1080, 1151, 1175, 1249, 1274, 1351, 1377, 1457 (list; graph; listen)

	OFFSET	`2,2`
	FORMULA	`a(n) = (n^2)/2-1 (n even), (n^2-n)/2-1 (n odd)`
	EXAMPLE	`a(3)=2 because if a middle row of 3 monominoes are removed from the 3 X 3, no L remains.`
	CROSSREFS	`Cf. A093353, A104519.` `Sequence in context: A041973 A042807 A005988 this_sequence A055673 A020895 A065139` `Adjacent sequences: A079323 A079324 A079325 this_sequence A079327 A079328 A079329`
	KEYWORD	`nonn`
	AUTHOR	`Mambetov Timur (timur_teufel(AT)mail.ru), Feb 13 2003`
	EXTENSIONS	`Edited by Don Reble (djr(AT)nk.ca), May 28 2007`

page 1

Search completed in 0.002 seconds

Last modified September 8 13:07 EDT 2008. Contains 143486 sequences.

AT&T Labs Research