id:A068907 - OEIS Search Results

Search: id:A068907

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n modulo 3.

+0
10

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; listen)

	OFFSET	`0,3`
	COMMENT	`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]`
	CROSSREFS	`Cf. A040051, A068908, A068909, A020919.` `Sequence in context: A112466 A166348 A127543 this_sequence A033687 A133457 A068067` `Adjacent sequences: A068904 A068905 A068906 this_sequence A068908 A068909 A068910`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 05 2002`

page 1

Search completed in 0.002 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research