|
Search: id:A042962
|
|
|
| A042962 |
|
The sequence e when b=[ 1,0,1,0,1,0,1,0,... ]. |
|
+0
1
|
|
| 1, 1, 2, 3, 4, 5, 8, 9, 12, 15, 18, 21, 28, 31, 38, 45, 52, 59, 72, 79, 92, 105, 118, 131, 154, 167, 190, 213, 236, 259, 296, 319, 356, 393, 430, 467, 524, 561, 618, 675, 732, 789, 872, 929, 1012, 1095, 1178, 1261
(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: A109850 A008749 A029000 this_sequence A027584 A161240 A165652
Adjacent sequences: A042959 A042960 A042961 this_sequence A042963 A042964 A042965
|
|
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
|
