id:A078406 - OEIS Search Results

Search: id:A078406

Displaying 1-1 of 1 results found.

page 1

Number of ways to partition 4*n into distinct positive integers.

+0
3

1, 2, 6, 15, 32, 64, 122, 222, 390, 668, 1113, 1816, 2910, 4582, 7108, 10880, 16444, 24576, 36352, 53250, 77312, 111322, 159046, 225585, 317788, 444793, 618784, 855906, 1177438, 1611388, 2194432, 2974400, 4013544, 5392550, 7215644 (list; graph; listen)

	OFFSET	`0,2`
	MATHEMATICA	`Table[PartitionsQ[4n], {n, 0, 40}]`
	CROSSREFS	`Bisection of A035294. Cf. A078407.` `a(n) = t(4*n,0), t as defined in A079211.` `Sequence in context: A087427 A141126 A056520 this_sequence A101352 A095380 A073838` `Adjacent sequences: A078403 A078404 A078405 this_sequence A078407 A078408 A078409`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Dec 27 2002`
	EXTENSIONS	`More terms from Don Reble (djr(AT)nk.ca), Jan 05 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research