|
%I #6 Nov 04 2013 11:58:54
%S 2,4,9,15,16,18,21,22,27,28,30,31,34,35,36,41,44
%N The sequence d when b is obtained by reversing the parity of Euler's partition function A000041.
%C Map a binary sequence b=[ b_1,... ] to a binary sequence c=[ c_1,... ] so that C=1/Product((1-x^i)^c_i == 1+Sum b_i*x^i mod 2.
%C This produces 2 new sequences: d={i:c_i=1} and e=[ 1,e_1,... ] where C=1+Sum e_i*x^i.
%K nonn
%O 0,1
%A _N. J. A. Sloane_ and _J. H. Conway_
|
