id:A067659 - OEIS Search Results

Search: id:A067659

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct parts such that number of parts is an odd number.

+0
5

0, 1, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 11, 14, 16, 19, 23, 27, 32, 38, 44, 52, 61, 71, 82, 96, 111, 128, 148, 170, 195, 224, 256, 293, 334, 380, 432, 491, 557, 630, 713, 805, 908, 1024, 1152, 1295, 1455, 1632, 1829, 2048, 2291, 2560, 2859, 3189, 3554, 3958, 4404 (list; graph; listen)

	OFFSET	`0,7`
	FORMULA	`For g.f. see under A067661.` `(A000009(n)-A010815(n))/2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 24 2002` `Expansion of (1-phi(-q))/(2*chi(-q)) in powers of q where phi(),chi() are Ramanujan theta functions. - Michael Somos Feb 14 2006`
	PROGRAM	`(PARI) {a(n)=local(A); if(n<0, 0, A=xO(x^n); polcoeff( (eta(x^2+A)/eta(x+A)-eta(x+A))/2, n))} / Michael Somos Feb 14 2006 */`
	CROSSREFS	`Sequence in context: A027198 A027197 A137793 this_sequence A153156 A017852 A029013` `Adjacent sequences: A067656 A067657 A067658 this_sequence A067660 A067661 A067662`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 23 2002`

page 1

Search completed in 0.002 seconds

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.

AT&T Labs Research