|
Search: id:A042959
|
|
|
| A042959 |
|
The sequence e when b=[ 1,1,1,1,0,1,1,1,.. ]. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 2, 3, 3, 3, 3, 5, 7, 9, 9, 9, 11, 15, 19, 21, 21, 25, 31, 39, 45, 49, 53, 63, 75, 87, 97, 107, 121, 143, 165, 187, 207, 233, 265, 303, 341, 381, 425, 479, 541, 611, 681, 761, 849, 951, 1063, 1185, 1315
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
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: A029088 A129263 A035367 this_sequence A111913 A075757 A096420
Adjacent sequences: A042956 A042957 A042958 this_sequence A042960 A042961 A042962
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas and J. H. Conway (conway(AT)math.princeton.edu)
|
|
|
Search completed in 0.002 seconds
|
