cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A115198 Parity of partitions of n, with 1 for even, 0 for odd (!). The definition follows.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0
Offset: 0

Views

Author

Wolfdieter Lang, Feb 23 2006

Keywords

Comments

The array with 0 and 1 interchanged is A115199.
The partitions appear in the Abramowitz-Stegun (A-St) order (see the reference, pp. 831-2).
A partition of n is (here) called even, resp. odd, if the number of even parts is even, resp. odd. A partition with no (0) even part is therefore even. Because the parity of permutations is linked, via their cycle structure, to the number of even parts of partitions one uses here 1 in order to mark the relevant (even) partitions.
The row length sequence of this array is p(n)=A000041(n) (number of partitions).

Examples

			[1];[0,1];[1,0,1];[0,1,1,0,1];[1,0,0,1,1,0,1];...
a(4,4)=0 because it refers to the 4th partition of n=4 of the
mentioned A-St ordering, namely to (1^2,2^1)=(1,1,2) which has an odd number
(1) of even parts.
a(5,4)=1 because (1^1,2^2)=(1,2,2) has an even number of even parts
(the number of even parts is in fact 2).
		

Crossrefs

The sequence of row lengths is A046682 (number of cycle types for even permutations).

Formula

a(n,m)= 1 if sum(e(n,m,2*j),j=1..floor(n/2)) is even, else 0, with the exponents e(n,m,k) of the m-th partition of n in the A-St order; i.e. the sum of the exponents of the even parts of the partition (1^e(n,m,1),2^e(n,m,2),..., n^e(n,m,n)) is even iff a(n,m)=1.