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 A357742 #26 Dec 26 2023 03:52:06 %S A357742 1,2,3,5,6,8,9,13,13,15,16,18,20,22,24,25,27,29,31,34,34,37,38,39,41, %T A357742 44,44,47,49,51,52,54,55,57,59,63,63,64,66,68,69,72,73,76,77,78,80,82, %U A357742 85,87 %N A357742 a(n) is the maximum binary weight of the squares of n-bit numbers. %F A357742 a(n) = max(A357658(2*n-2), A357658(2*n-1)). %e A357742 bit | %e A357742 length | possible binary weight of k^2 %e A357742 of k | 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 %e A357742 = n | the rightmost value is a(n) %e A357742 -------+-------------------------------------------------------------- %e A357742 1 | 0 1 %e A357742 2 | 1 2 - - %e A357742 3 | 1 2 3 - - - %e A357742 4 | 1 2 3 4 5 - - - %e A357742 5 | 1 2 3 4 5 6 - - - - %e A357742 6 | 1 2 3 4 5 6 7 8 - - - - %e A357742 7 | 1 2 3 4 5 6 7 8 9 - - - - - %e A357742 8 | 1 2 3 4 5 6 7 8 9 10 11 - 13 - - - %e A357742 9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 - - - - - %e A357742 10 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 - - - - - %o A357742 (Python 3.10+) %o A357742 def A357742(n): return max((k**2).bit_count() for k in range(1<<n-1,1<<n)) # _Chai Wah Wu_, Oct 17 2022 %Y A357742 Cf. A000290, A159918, A357304, A357658. %K A357742 nonn,base,hard,more %O A357742 1,2 %A A357742 _Karl-Heinz Hofmann_ and _Hugo Pfoertner_ , Oct 11 2022 %E A357742 a(47)-a(50) from _Martin Ehrenstein_, Dec 26 2023