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 A059875 #9 Oct 13 2022 20:50:06 %S A059875 1,3,5,13,21,52,84,210,392,905,1601,3652,7173,15364,28932,61952, %T A059875 122900,253969,493572,1017858,2031636,4128801,8159232,16547841, %U A059875 33030657,66584836,132251649,266600448,532677128,1069548544,2139095042 %N A059875 The lexicographically last sequence of binary encodings of solutions satisfying the equation given in A059871. %C A059875 Apply bin_prime_sum (see A059876) to this sequence and you get A000040, the prime numbers. %H A059875 Sean A. Irvine, <a href="/A059875/b059875.txt">Table of n, a(n) for n = 1..50</a> %p A059875 map(last_term, primesums_primes_mult(16)); last_term := proc(l) local n: n := nops(l); if(0 = n) then ([]) else (op(n,l)): fi: end: # primesums_primes_mult given in A059871. %Y A059875 Cf. A059873, A059874. %K A059875 nonn %O A059875 1,2 %A A059875 _Antti Karttunen_, Feb 05 2001 %E A059875 More terms from _Naohiro Nomoto_, Sep 12 2001 %E A059875 More terms from Larry Reeves (larryr(AT)acm.org), Nov 20 2003