|
|
A059874
|
|
The lexicographically earliest sequence of binary encodings of solutions satisfying the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 + 1, where p_i is the i-th prime number.
|
|
4
|
|
|
1, 3, 5, 13, 21, 51, 83, 175, 303, 639, 1143, 2539, 4571, 9711, 17903, 36735, 69499, 143339, 270327, 556031, 1080315, 2195431, 4259819, 8646647, 17031163, 34078647, 67632893, 136282091, 270467055, 541064701, 1077935867, 2162163707, 4311220203, 8623484927
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
I.e. like A059873, but the encodings must be "odd", with the least significant bit set. I do not know whether this sequence can be extended infinitely.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|