|
%I M0448 #33 Oct 27 2023 05:56:55
%S 0,1,2,3,4,4,5,4,4,5,6,6,7,7,7,5,6,6,7,7,8,8,9,7,6,7,5,6,7,8,9,6,7,8,
%T 9,6,7,8,9,9,10,10,11,10,9,10,11,8,7,8,9,9,10,7,8,8,9,9,10,10,11,11,
%U 10,6,7,8,9,10,11,11,12,8,9,9,9,10,11,10,11,10
%N Operator-oriented complexity of n, i.e., the minimum number of occurrences of +, *, and ^ needed to build n from a supply of ones.
%C The formula is correct because k ones require exactly k - 1 binary operators to reduce to a single value. - _Glen Whitney_, Oct 06 2021
%D 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.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Alois P. Heinz, <a href="/A005208/b005208.txt">Table of n, a(n) for n = 1..10000</a>
%H W. A. Beyer, <a href="/A005208/a005208.pdf">Letter to N. J. A. Sloane, 1980</a>
%H 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]
%H <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>
%F a(n) = A025280(n) - 1.
%Y Cf. A025280.
%K nonn
%O 1,3
%A _N. J. A. Sloane_
%E Name clarified by _Glen Whitney_, Oct 06 2021
|
