id:A060655 - OEIS Search Results

Search: id:A060655

Displaying 1-1 of 1 results found.

page 1

Pack n integer sided rectangles into the smallest possible square so that no sides of the rectangle are the same. Sequence gives the side of the smallest square.

+0
1

2, 4, 6, 8, 11, 14, 18, 21, 25, 29, 33, 37 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Those terms that are > ceil(sqrt(n(n+1)(2n+1)/3)) are only the best currently known solutions.`
	LINKS	`E. J. Friedman, Math. Magic: August 1999, Question #2`
	FORMULA	`a(n)>=sqrt(n(n+1)(2n+1)/3).`
	CROSSREFS	`Sequence in context: A134421 A092777 A006463 this_sequence A117490 A032514 A011858` `Adjacent sequences: A060652 A060653 A060654 this_sequence A060656 A060657 A060658`
	KEYWORD	`hard,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Apr 18 2001`
	EXTENSIONS	`Additional comments from Larry Reeves (larryr(AT)acm.org), Apr 19 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research