A259466 Smallest number of 10-bit complement complexity n.

0, 2, 3, 4, 5, 7, 11, 13, 21, 39, 41, 43, 115, 173, 311

Offset

0,2

Comments

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

References

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.

Links

Table of n, a(n) for n=0..14.

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. [Annotated scanned copy]

Crossrefs

Cf. A003037.

Sequence in context: A192586 A003037 A347983 * A046420 A108318 A358876

Adjacent sequences: A259463 A259464 A259465 * A259467 A259468 A259469

Keyword

nonn,more

Author

N. J. A. Sloane, Jul 01 2015

Extensions

Name clarified by Glen Whitney, Oct 05 2021

Status

approved