|
Search: id:A042953
|
|
|
| A042953 |
|
The sequence e when b=[ 1,0,1,1,1,.. ]. |
|
+0
1
|
|
| 1, 1, 2, 3, 5, 7, 11, 15, 21, 29, 39, 51, 69, 89, 115, 147, 187, 235, 297, 369, 457, 565, 693, 845, 1031, 1249, 1507, 1815, 2175, 2597, 3099, 3681, 4359, 5153, 6073, 7137, 8377, 9803, 11447, 13345, 15521, 18013
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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: A008636 A008630 A035969 this_sequence A023028 A035977 A101049
Adjacent sequences: A042950 A042951 A042952 this_sequence A042954 A042955 A042956
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas and J. H. Conway (conway(AT)math.princeton.edu)
|
|
|
Search completed in 0.002 seconds
|
