id:A093997 - OEIS Search Results

Search: id:A093997

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n with an odd number of distinct Fibonacci parts.

+0
2

0, 1, 1, 1, 0, 1, 1, 0, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 3, 1, 2, 2, 1, 2, 2, 2, 2, 0, 2, 2, 1, 3, 2, 3, 2, 1, 3, 2, 2, 3, 1, 2, 3, 2, 3, 1, 2, 2, 0, 3, 2, 2, 3, 2, 3, 3, 2, 4, 2, 2, 4, 1, 3, 3, 2, 4, 2, 3, 3, 1, 3, 3, 3, 4, 1, 3, 3, 1, 4, 2, 2, 2, 1, 3, 2, 2, 4, 2, 3, 4, 2, 4, 3, 3, 5, 1, 4, 4, 2 (list; graph; listen)

	OFFSET	`0,9`
	FORMULA	`G.f.: (prod_{k=2..inf} (1 + x^{F_k}) - prod_{k=2..inf} (1 - x^{F_k}))/2`
	MATHEMATICA	`Take[ CoefficientList[ Expand[ Product[1 + x^Fibonacci[k], {k, 2, 13}]/2 - Product[1 - x^Fibonacci[k], {k, 2, 13}]/2], x], 105] (from Robert G. Wilson v May 29 2004)`
	CROSSREFS	`Cf. A000119.` `Sequence in context: A122934 A072170 A056624 this_sequence A157196 A063014 A097295` `Adjacent sequences: A093994 A093995 A093996 this_sequence A093998 A093999 A094000`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naoki Sato (nsato7(AT)yahoo.ca), May 24 2004`
	EXTENSIONS	`Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), May 29 2004`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research