id:A115944 - OEIS Search Results

Search: id:A115944

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct factorials.

+0
5

1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(A115944(n)) > 0; a(A115944(n)) = 0;` `a(A115647(n)) > 0;` `what is the smallest n such that a(n)>1?.`
	FORMULA	`G.f.=product(1+x^(j!), j=1..infinity). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 06 2006`
	EXAMPLE	`a(32)=1 because we have [24,6,2].`
	MAPLE	`g:=product(1+x^(j!), j=1..7): gser:=series(g, x=0, 125): seq(coeff(gser, x, n), n=1..122); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 06 2006`
	CROSSREFS	`Cf. A064986.` `Sequence in context: A115361 A115358 A117904 this_sequence A071003 A113431 A116915` `Adjacent sequences: A115941 A115942 A115943 this_sequence A115945 A115946 A115947`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 02 2006`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research