|
|
A259466
|
|
Smallest number of 10-bit complement complexity n.
|
|
1
|
|
|
0, 2, 3, 4, 5, 7, 11, 13, 21, 39, 41, 43, 115, 173, 311
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|