|
Search: id:A042955
|
|
|
| A042955 |
|
The sequence e when b=[ 1,1,0,1,1,.. ]. |
|
+0
1
|
|
| 1, 1, 1, 2, 3, 3, 5, 7, 9, 11, 15, 19, 25, 31, 39, 49, 61, 73, 91, 111, 135, 163, 197, 235, 283, 335, 399, 473, 559, 655, 773, 903, 1057, 1233, 1435, 1663, 1933, 2231, 2575, 2969, 3419, 3921, 4501, 5151, 5891
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
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: A030729 A030779 A111865 this_sequence A035553 A108961 A017984
Adjacent sequences: A042952 A042953 A042954 this_sequence A042956 A042957 A042958
|
|
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
|
