id:A078409 - OEIS Search Results

Search: id:A078409

Displaying 1-1 of 1 results found.

page 1

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

+0
3

1, 3, 8, 18, 38, 76, 142, 256, 448, 760, 1260, 2048, 3264, 5120, 7917, 12076, 18200, 27130, 40026, 58499, 84756, 121792, 173682, 245920, 345856, 483330, 671418, 927406, 1274118, 1741521, 2368800, 3207086, 4322816, 5802008, 7755776 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(n) = t(4*n+1, 0), t as defined in A079211.`
	CROSSREFS	`Bisection of A078408. Cf. A035294, A000009, A078410.` `Sequence in context: A099845 A036635 A000713 this_sequence A036642 A000235 A006478` `Adjacent sequences: A078406 A078407 A078408 this_sequence A078410 A078411 A078412`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Dec 27 2002`
	EXTENSIONS	`More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 28 2002`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research