login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Cf. A003037.
Sequence in context: A192586 A003037 A347983 * A046420 A108318 A358876
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Jul 01 2015
EXTENSIONS
Name clarified by Glen Whitney, Oct 05 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)