id:A109705 - OEIS Search Results

Search: id:A109705

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into parts each equal to 3 mod 7.

+0
1

0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 3, 1, 2, 4, 2, 2, 4, 4, 2, 4, 5, 3, 4, 6, 5, 4, 6, 7, 5, 6, 8, 8, 6, 9, 11, 7, 9, 13, 10, 9, 14, 14, 10, 15, 17, 14, 15, 19, 19, 16, 20, 24, 20, 21, 27, 27, 22, 29, 33, 27, 30, 38, 35, 32, 41, 44, 37, 43, 51, 47, 45 (list; graph; listen)

	OFFSET	`1,20`
	FORMULA	`G.f.=1/product(1-x^(3+7j), j=0..infinity)-1. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 14 2006`
	EXAMPLE	`a(20)=2 because we have 20=17+3=10+10.`
	MAPLE	`g:=1/product(1-x^(3+7*j), j=0..20)-1: gser:=series(g, x=0, 90): seq(coeff(gser, x, n), n=1..87); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 14 2006`
	CROSSREFS	`Sequence in context: A089643 A115268 A103610 this_sequence A025848 A065382 A066888` `Adjacent sequences: A109702 A109703 A109704 this_sequence A109706 A109707 A109708`
	KEYWORD	`nonn`
	AUTHOR	`Erich Friedman (efriedma(AT)stetson.edu), Aug 07 2005`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research