|
Search: id:A042960
|
|
|
| A042960 |
|
The sequence d when b is obtained by reversing the parity of Euler's partition function A000041. |
|
+0
1
|
|
| 2, 4, 9, 15, 16, 18, 21, 22, 27, 28, 30, 31, 34, 35, 36, 41, 44
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
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.
This produces 2 new sequences: d={i:c_i=1} and e=[ 1,e_1,... ] where C=1+Sum e_i*x^i.
|
|
CROSSREFS
|
Sequence in context: A119637 A113862 A036277 this_sequence A045975 A058296 A022948
Adjacent sequences: A042957 A042958 A042959 this_sequence A042961 A042962 A042963
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com) and J. H. Conway (conway(AT)math.princeton.edu)
|
|
|
Search completed in 0.002 seconds
|
