id:A072576 - OEIS Search Results

Search: id:A072576

Displaying 1-1 of 1 results found.

page 1

Limit of number of compositions (unordered partitions) of m into distinct parts where largest part is exactly m-n, for m sufficiently large given n.

+0
3

1, 2, 2, 8, 8, 14, 38, 44, 68, 98, 242, 272, 440, 590, 878, 1772, 2180, 3194, 4466, 6320, 8432, 16190, 19262, 28580, 38276, 54314, 70730, 99152, 163328, 204230, 286670, 386132, 527132, 695978, 941738, 1220984, 1950128, 2390294, 3321398, 4342148 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`Index entries for sequences related to compositions`
	FORMULA	`a(n) =Sum_k (k+1)!A060016(n, k) =Sum_k (k+1)A072574(n, k).`
	EXAMPLE	`a(3)=8 because for any m>6 the number of compositions of e.g. m=7 into distinct parts where the largest part is exactly m-3=7-3=4 is eight, since 7 can be written as 4+3 =4+2+1 =4+1+2 =3+4 =2+4+1 =2+1+4 =1+4+2 =1+2+4.`
	CROSSREFS	`Cf. A072575.` `Sequence in context: A138102 A151924 A058524 this_sequence A060818 A082887 A137583` `Adjacent sequences: A072573 A072574 A072575 this_sequence A072577 A072578 A072579`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 21 2002`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research