A115198 Parity of partitions of n, with 1 for even, 0 for odd (!). The definition follows.
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
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).
Links
- M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
- M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972.
- W. Lang: First 10 rows.
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.
Comments