id:A115723 - OEIS Search Results

Search: id:A115723

Displaying 1-1 of 1 results found.

page 1

Table of partitions of n with maximum rectangle k.

+0
2

1, 0, 2, 0, 1, 2, 0, 0, 2, 3, 0, 0, 1, 4, 2, 0, 0, 0, 5, 2, 4, 0, 0, 0, 3, 4, 6, 2, 0, 0, 0, 1, 4, 11, 2, 4, 0, 0, 0, 0, 3, 14, 4, 6, 3, 0, 0, 0, 0, 1, 15, 6, 12, 4, 4, 0, 0, 0, 0, 0, 13, 8, 18, 9, 6, 2, 0, 0, 0, 0, 0, 8, 10, 25, 14, 12, 2, 6, 0, 0, 0, 0, 0, 4, 9, 30, 22, 20, 4, 10, 2 (list; table; graph; listen)

	OFFSET	`1,3`
	COMMENT	`T(n,k)=0 if n > A006218(k).`
	LINKS	`Eric Weisstein's World of Mathematics, Ferrers Diagram.`
	EXAMPLE	`The table starts: 1; 0,2; 0,1,2; 0,0,2,3; 0,0,1,4,2.`
	CROSSREFS	`Cf. A000041 (row sums), A115724 (column sums), A115727, A115728, A006218.` `Sequence in context: A072574 A058650 A112177 this_sequence A114525 A127672 A134979` `Adjacent sequences: A115720 A115721 A115722 this_sequence A115724 A115725 A115726`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 11 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research