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 A259368 #16 Sep 08 2022 08:46:13 %S A259368 1,3,5,9,12,16,20,25,29,34,39,44,49,54,59,65,70,76,81,87,93,99,105, %T A259368 111,117,123,129,135,141,148,154,161,167,173,180,187,193,200,207,213, %U A259368 220,227,234,241,248,255,262,269,276,283,290,297,304,311,318,326,333 %N A259368 Number of digits in n^n when written in binary. %F A259368 a(n) = floor(n*log(n)/log(2)) + 1. %F A259368 a(n) = A070939(A000312(n)). - _Michel Marcus_, Jul 03 2015 %e A259368 For n=3, 3^3=11011_2 so a(3)=5. %t A259368 Array[IntegerLength[#^#, 2] &, 60] (* or *) %t A259368 Array[Floor[# Log[2, #]] + 1 &, 60] (* _Michael De Vlieger_, Jul 03 2015 *) %o A259368 (PARI) a(n) = #binary(n^n); \\ _Michel Marcus_, Jul 03 2015 %o A259368 (Magma) [Floor(n*Log(n)/Log(2)) + 1: n in [1..70]]; // _Vincenzo Librandi_, Jul 15 2015 %Y A259368 Cf. A000312, A066022, A070939. %K A259368 nonn,easy,base %O A259368 1,2 %A A259368 _Adam J.T. Partridge_, Jun 25 2015