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 A348262 #17 Dec 06 2024 11:23:42
%S A348262 1,2,3,4,5,6,7,5,5,6,7,8,9,10,11,6,7,8,9,10,11,12,13,11,7,8,6,7,8,9,
%T A348262 10,7,8,9,10,8,9,10,11,12,12,13,12,13,13,14,15,13,9,10,11,12,13,12,13,
%U A348262 14,14,14,13,14,15,16,14,7,8,9,10,11,12,13,14,12,12,13,14,15,16,17
%N A348262 Number of 1's required to build n using + and ^.
%H A348262 Glen Whitney, <a href="/A348262/b348262.txt">Table of n, a(n) for n = 1..10000</a>
%H A348262 Edinah K. Ghang and Doron Zeilberger, <a href="https://arxiv.org/abs/1303.0885">Zeroless Arithmetic: Representing Integers ONLY using ONE</a>, arXiv:1303.0885 [math.CO], 2013.
%H A348262 Glen Whitney, <a href="/A348262/a348262.py.txt">Python3.8 program to compute a(n)</a>
%H A348262 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>
%F A348262 a(n) = (A213924(n) + 1)/2.
%e A348262 11+111++^ is a minimal-length RPN formula with value 8, using just these operators. It contains five occurrences of the symbol "1". Hence, a(8) = 5.
%Y A348262 Cf. A213924 (expression-length complexity with the same set {1,+,^}).
%Y A348262 Cf. A005245 (variant using + and *), A025280 (using +, *, and ^), A091333 (using +, -, and *), A091334 (using +, -, *, and ^), A348089 (using +, -, *, /, and ^).
%K A348262 nonn
%O A348262 1,2
%A A348262 _Glen Whitney_, Oct 09 2021