|
| |
|
|
A042951
|
|
The sequence e when b=[ 0,1,1,1,1,.. ].
|
|
0
| |
|
|
1, 0, 1, 1, 1, 1, 3, 1, 3, 3, 3, 3, 7, 3, 7, 7, 7, 7, 13, 7, 13, 13, 13, 13, 23, 13, 23, 23, 23, 23, 37, 23, 37, 37, 37, 37, 57, 37, 57, 57, 57, 57, 83, 57, 83, 83, 83, 83, 119, 83, 119, 119, 119, 119, 165, 119, 165, 165
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,7
|
|
|
COMMENTS
| 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: A025796 A024163 A029155 * A194299 A029154 A136297
Adjacent sequences: A042948 A042949 A042950 * A042952 A042953 A042954
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com) and J. H. Conway (conway(AT)math.princeton.edu)
|
| |
|
|
