login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050314 Triangle: a(n,k)=number of partitions of n whose xor-sum is k. 3
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; refs; listen; history; internal format)
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 * A122157 A080378 A120439

Adjacent sequences:  A050311 A050312 A050313 * A050315 A050316 A050317

KEYWORD

nonn,tabl

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Sep 15 1999.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 13:08 EST 2012. Contains 205623 sequences.