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 A383329 #8 Apr 24 2025 08:53:59 %S A383329 0,1,2,2,3,3,4,3,4,4,5,4,5,5,5,4,5,5,6,5,6,6,6,5,6,6,6,6,7,6,7,5,6,6, %T A383329 7,6,7,7,7,6,7,7,7,7,7,7,8,6,7,7,7,7,8,7,8,7,8,8,8,7,8,8,8,6,7,7,8,7, %U A383329 8,8,9,7,8,8,8,8,9,8,9,7,8,8,8,8,8,8,9 %N A383329 Number of multiplications required to compute x^n by Knuth's power tree method. %C A383329 n appears in row a(n)+1 of A114622. %C A383329 n appears A114623(n+1) times. %C A383329 First differs from A003313 at n = 77. %D A383329 Donald E. Knuth, The Art of Computer Programming, Vol. 2, 3rd edition, Addison-Wesley, 1998. See page 464. %H A383329 Pontus von Brömssen, <a href="/A383329/b383329.txt">Table of n, a(n) for n = 1..10000</a> %F A383329 a(n) = a(A122352(n)) + 1 for n >= 2. %F A383329 a(A115617(k)) = k and a(n) < k for n < A115617(k). %Y A383329 Cf. A003313, A113945, A114622, A114623, A115617 (indices of records), A122352. %K A383329 nonn %O A383329 1,3 %A A383329 _Pontus von Brömssen_, Apr 24 2025