|
Search: id:A041003
|
|
|
| A041003 |
|
The sequence e, given that c is a left shift by one place of b. |
|
+0
1
|
|
| 1, 1, 1, 2, 3, 3, 4, 6, 7, 8, 10, 12, 14, 16, 20, 23, 26, 30, 36, 41, 47, 55, 64, 73, 83, 96, 111, 125, 144, 165, 187, 211, 241, 272, 306, 346, 391, 439, 493, 553, 622, 695, 779, 871, 974, 1086, 1211, 1348, 1502, 1671
(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
|
Cf. A041002-A041004.
Sequence in context: A102187 A133610 A029033 this_sequence A067592 A036018 A101195
Adjacent sequences: A041000 A041001 A041002 this_sequence A041004 A041005 A041006
|
|
KEYWORD
|
nonn,easy,eigen
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
