A068907 - OEIS

This site is supported by donations to The OEIS Foundation.

A068907

Number of partitions of n modulo 3.

1, 1, 2, 0, 2, 1, 2, 0, 1, 0, 0, 2, 2, 2, 0, 2, 0, 0, 1, 1, 0, 0, 0, 1, 0, 2, 0, 1, 1, 2, 0, 2, 0, 0, 1, 0, 1, 1, 2, 0, 0, 0, 2, 0, 1, 1, 0, 2, 0, 2, 1, 0, 0, 0, 1, 1, 2, 0, 2, 1, 2, 0, 1, 0, 1, 2, 2, 2, 0, 2, 0, 0, 1, 1, 2, 0, 2, 1, 2, 2, 0, 1, 1, 2, 2, 2, 1, 2, 0, 1, 2, 1, 2, 2, 2, 1, 2, 0, 1, 1, 1, 2, 0, 2, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	COMMENTS	`Of the partitions of numbers from 1 to 100000: 33344 are 0, 33193 are 1 and 33463 are 2 modulo 3.`
	LINKS	`Henry Bottomley, Partition calculators using java applets` `Index entries for sequences related to partitions`
	FORMULA	`a(n) =A010872(A000041(n)) =A068906(3, n)` `a(n) = Pm(n,1) with Pm(n,k) = if k<n then (Pm(n-k,k) + Pm(n,k+1)) mod 3 else 0^(n*(k-n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 09 2009]`
	MATHEMATICA	`Table[ Mod[ PartitionsP@ n, 3], {n, 105}] (* Robert G. Wilson v, March 25 2011 *)`
	CROSSREFS	`Cf. A040051, A068908, A068909, A020919.` `Sequence in context: A112466 A166348 A127543 * A033687 A133457 A068067` `Adjacent sequences: A068904 A068905 A068906 * A068908 A068909 A068910`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 05 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 19:37 EST 2012. Contains 205663 sequences.