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 A383335 #9 May 02 2025 12:11:45 %S A383335 0,1,2,2,3,3,4,3,3,4,4,4,5,5,4,3,4,4,5,4,5,5,6,4,4,5,3,4,4,4,5,4,5,5, %T A383335 5,4,5,5,5,5,6,5,6,6,5,6,6,5,5,5,6,6,6,4,5,5,5,5,6,5,6,6,6,4,5,5,5,5, %U A383335 6,5,6,5,6,6,5,6,6,6,7,5,4,5,5,5,5,6,5 %N A383335 Length of shortest addition-multiplication-exponentiation chain for n. %C A383335 An addition-multiplication-exponentiation chain for n is a finite sequence of numbers, starting with 1 and ending with n, in which each element except 1 equals x+y, x*y, or x^y for two preceding elements x and y (not necessarily distinct). The length of the chain is the number of elements in the chain, excluding 1. %H A383335 Pontus von Brömssen, <a href="/A383335/b383335.txt">Table of n, a(n) for n = 1..10000</a> %e A383335 a(248) = 5 because the shortest addition-multiplication-exponentiation chain for 248 has length 5: (1, 2, 3, 5, 243, 248). %Y A383335 Cf. A003313, A128998, A230697, A383336, A383337. %K A383335 nonn %O A383335 1,3 %A A383335 _Pontus von Brömssen_, Apr 27 2025