id:A088931 - OEIS Search Results

Search: id:A088931

Displaying 1-1 of 1 results found.

page 1

G.f.: Sum_{n >= 1} ( x^(2^n)/ ((1+x^(2^(n-1)))*Product_{j=0..n-1} (1-x^(2^j)) ) ).

+0
3

0, 0, 1, 0, 2, 1, 2, 1, 4, 3, 5, 4, 7, 6, 8, 7, 12, 11, 15, 14, 20, 19, 24, 23, 31, 30, 37, 36, 45, 44, 52, 51, 64, 63, 75, 74, 90, 89, 104, 103, 124, 123, 143, 142, 167, 166, 190, 189, 221, 220, 251, 250, 288, 287, 324, 323, 369, 368, 413, 412, 465, 464, 516, 515, 580 (list; graph; listen)

	OFFSET	`0,5`
	COMMENT	`This is the g.f. for the number of non-squashing partitions with a repeated part, that is, A000123(n) - A088567(n).`
	LINKS	`N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, Discrete Math., 294 (2005), 259-274.`
	EXAMPLE	`x^2/((1 + x)(1 - x)) + x^4/((1 + x^2)(1 - x)(1 - x^2)) + x^8/((1 + x^4)(1 - x)(1 - x^2)(1 - x^4)) + ...`
	CROSSREFS	`Apart from initial terms, same as A088980.` `Sequence in context: A090924 A160595 A105778 this_sequence A088980 A157333 A002852` `Adjacent sequences: A088928 A088929 A088930 this_sequence A088932 A088933 A088934`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Dec 02 2003`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research