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 A259466 #14 Oct 06 2021 12:15:50 %S A259466 0,2,3,4,5,7,11,13,21,39,41,43,115,173,311 %N A259466 Smallest number of 10-bit complement complexity n. %C A259466 Beyer, Stein, and Ulam (see references) define the unary operation of "b-bit complementation" as j -> 2^b - 1 - j. This sequence a(n) gives the smallest number k such that at least n+1 zeros and/or ones are required to build k using +, *, ^, and 10-bit complementation. - _Glen Whitney_, Oct 05 2021 %D A259466 W. A. Beyer, M. L. Stein and S. M. Ulam, The Notion of Complexity. Report LA-4822, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, December 1971. %H A259466 W. A. Beyer, M. L. Stein and S. M. Ulam, <a href="/A003037/a003037.pdf">The Notion of Complexity</a>. Report LA-4822, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, December 1971. [Annotated scanned copy] %Y A259466 Cf. A003037. %K A259466 nonn,more %O A259466 0,2 %A A259466 _N. J. A. Sloane_, Jul 01 2015 %E A259466 Name clarified by _Glen Whitney_, Oct 05 2021