|
Search: id:A042957
|
|
|
| A042957 |
|
The sequence e when b=[ 1,1,1,0,1,1,.. ]. |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 3, 3, 3, 5, 7, 9, 9, 11, 15, 19, 21, 25, 31, 39, 45, 53, 63, 75, 87, 103, 121, 143, 165, 193, 225, 263, 301, 347, 401, 467, 535, 613, 701, 807, 921, 1053, 1197, 1365, 1551, 1767, 2003, 2269, 2563
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
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: A036024 A036029 A035362 this_sequence A131048 A126868 A119688
Adjacent sequences: A042954 A042955 A042956 this_sequence A042958 A042959 A042960
|
|
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
|
