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 A286713 #5 May 13 2017 23:47:26 %S A286713 2,5,9,19,20,25,32,46,54,69,80,99,130,136,160,188,206,218,268,300,330, %T A286713 339,360,398,411,453,516,536,552,577,641,702,753,797,824,859,948,985, %U A286713 1072,1111,1196,1237,1320,1337,1444,1489,1568,1597,1649,1741,1816,1838 %N A286713 Partial sums of A286709. %C A286713 For any k>0, let bin(k) = the string corresponding to the binary representation of k, and neg(k) = bin(k) under the character substitution '0' <-> '1'; bin(a(n)) contains neg(n) as a substring. %H A286713 Rémy Sigrist, <a href="/A286713/b286713.txt">Table of n, a(n) for n = 1..10000</a> %H A286713 Rémy Sigrist, <a href="/A286713/a286713.pl.txt">Perl program for A286713</a> %e A286713 a(3) = A286709(1) + A286709(2) + A286709(3) = 2 + 3 + 4 = 9. %Y A286713 Cf. A286709. %K A286713 nonn,base %O A286713 1,1 %A A286713 _Rémy Sigrist_, May 13 2017