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