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 A064631 #15 Jan 09 2024 16:12:58 %S A064631 2,3,3,5,5,4,7,7,8,10,11,12,13,14,15,16,16,16,18,18,20,22,21,23,25,25, %T A064631 24,28,27,29,31,32,33,34,35,36,37,37,39,40,39,42,42,44,44,46,46,46,49, %U A064631 50,51,51,51,54,55,55,57,57,59,60,60,61,63,64,64,66,60,62,67,70,69,72 %N A064631 a(n) = ceiling(log_2(A064630(n))). %C A064631 In A064630, using a greedy algorithm we write 4^n = x*3^n+y*2^n+z*1^n and A064630(n) = x+y+z. This sequence is a measure of the "length" or complexity of those solutions. %F A064631 a(n) = A029837(A064630(n)) = ceiling(log_2(A064630(n))). %Y A064631 Cf. A002379, A002380, A060692, A064628, A064629, A064630, A029837. %K A064631 nonn %O A064631 1,1 %A A064631 _Labos Elemer_, Oct 01 2001 %E A064631 Initial terms corrected and entry revised by _Sean A. Irvine_, Jul 18 2023