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 A385970 #15 Aug 12 2025 08:22:24 %S A385970 1,2,1,2,2,2,3,3,3,2,3,3,2,3,3,2,4,3,4,4,1,2,3,3,2,3,3,3,2,4,4,3,4,3, %T A385970 2,3,4,4,4,4,3,4,4,4,3,4,4,4,4,3,2,4,3,3,4,3,4,4,5,4,4,4,4,3,3,5,5,4, %U A385970 3,4,4,4,4,3,4,5,2,3,4,4,5,4,4,5,4,4,3,4,5,4,2,4,3,5,4,5 %N A385970 a(n) is the minimum number of powers needed to obtain the n-th term of sequence A385969. %C A385970 The sequence is unbounded (conjectured). %e A385970 a(1) = 1, as 4 = 2^2 %e A385970 a(2) = 2, as 17 = 2^3 + 3^2 %e A385970 a(3) = 1, as 27 = 3^3 %e A385970 a(4) = 2, as 31 = 2^2 + 3^3 %e A385970 a(7) = 3, as 59 = 2^4 + 3^3 + 4^2 %Y A385970 Cf. A385969, A385232, A385233. %K A385970 nonn %O A385970 1,2 %A A385970 _Alberto Zanoni_, Jul 14 2025