id:A050314 - OEIS Search Results

Search: id:A050314

Displaying 1-1 of 1 results found.

page 1

Triangle: a(n,k)=number of partitions of n whose xor-sum is k.

+0
4

1, 0, 1, 1, 0, 1, 0, 1, 0, 2, 2, 0, 2, 0, 1, 0, 3, 0, 2, 0, 2, 4, 0, 3, 0, 2, 0, 2, 0, 4, 0, 4, 0, 2, 0, 5, 6, 0, 5, 0, 4, 0, 6, 0, 1, 0, 8, 0, 6, 0, 8, 0, 6, 0, 2, 10, 0, 9, 0, 11, 0, 8, 0, 2, 0, 2, 0, 11, 0, 14, 0, 12, 0, 12, 0, 2, 0, 5, 16, 0, 18, 0, 15, 0, 16, 0, 4, 0, 6, 0, 2, 0, 23, 0, 20, 0 (list; table; graph; listen)

	OFFSET	`0,10`
	EXAMPLE	`1; 0,1; 1,0,1; 0,1,0,2; 2,0,2,0,1; ...`
	CROSSREFS	`a(2n, 0)=A048833(n). a(2n+1, 1)=A050316(n). a(n, n)=A050315(n).` `Sequence in context: A089799 A073464 A142242 this_sequence A143787 A122157 A080378` `Adjacent sequences: A050311 A050312 A050313 this_sequence A050315 A050316 A050317`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Sep 15 1999.`

page 1

Search completed in 0.002 seconds

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.

AT&T Labs Research