id:A078407 - OEIS Search Results

Search: id:A078407

Displaying 1-1 of 1 results found.

page 1

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

+0
3

1, 4, 10, 22, 46, 89, 165, 296, 512, 864, 1426, 2304, 3658, 5718, 8808, 13394, 20132, 29927, 44046, 64234, 92864, 133184, 189586, 267968, 376256, 525016, 728260, 1004544, 1378304, 1881578, 2556284, 3457027, 4654670, 6240974, 8334326 (list; graph; listen)

	OFFSET	`0,2`
	MATHEMATICA	`Table[PartitionsQ[4n+2], {n, 0, 40}]`
	CROSSREFS	`Bisection of A035294. Cf. A078406.` `a(n) = t(4*n+2, 0), t as defined in A079211.` `Sequence in context: A023628 A004798 A038621 this_sequence A099018 A033484 A008267` `Adjacent sequences: A078404 A078405 A078406 this_sequence A078408 A078409 A078410`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), 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 November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research