id:A094909 - OEIS Search Results

Search: id:A094909

Displaying 1-1 of 1 results found.

page 1

Let p_k(n) = number of partitions of n into exactly k parts; sequence gives p_3(n-3) + p_2(n-2) + 1.

+0
1

1, 1, 1, 2, 2, 4, 4, 6, 7, 9, 10, 13, 14, 17, 19, 22, 24, 28, 30, 34, 37, 41, 44, 49, 52, 57, 61, 66, 70, 76, 80, 86, 91, 97, 102, 109, 114, 121, 127, 134, 140, 148, 154, 162, 169, 177, 184, 193, 200, 209, 217, 226, 234, 244, 252, 262, 271, 281, 290, 301, 310, 321 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`S. L. Devadoss, Combinatorial equivalence of real moduli spaces, Notices Amer. Math. Soc., 51 (No. 6, 2004), 620-628 (see Cor. 7).`
	FORMULA	`G.f.: (1-x^2+2x^5-x^6) / [(1-x^3)(1+x)(1-x)^3].`
	CROSSREFS	`p_k(n) = k-th column of A008284.` `Sequence in context: A018819 A127370 A106247 this_sequence A029008 A136343 A161254` `Adjacent sequences: A094906 A094907 A094908 this_sequence A094910 A094911 A094912`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jun 18 2004`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research