This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A059874 #8 Oct 13 2022 18:26:07
%S A059874 1,3,5,13,21,51,83,175,303,639,1143,2539,4571,9711,17903,36735,69499,
%T A059874 143339,270327,556031,1080315,2195431,4259819,8646647,17031163,
%U A059874 34078647,67632893,136282091,270467055,541064701,1077935867,2162163707,4311220203,8623484927
%N 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.
%C A059874 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.
%H A059874 Sean A. Irvine, <a href="/A059874/b059874.txt">Table of n, a(n) for n = 1..50</a>
%Y A059874 Cf. A059873, A059875.
%K A059874 nonn
%O A059874 1,2
%A A059874 _Antti Karttunen_, Feb 05 2001
%E A059874 More terms from _Naohiro Nomoto_, Sep 12 2001
%E A059874 More terms from _Sean A. Irvine_, Oct 13 2022