A357754 - OEIS

%I #25 Oct 13 2022 15:27:58

%S 4,9,25,49,121,225,484,961,2025,3969,8100,16129,32761,65025,131044,

%T 261121,524176,1046529,2096704,4190209,8386816,16769025,33547264,

%U 67092481,134212225,268402689,536848900,1073676289,2147395600,4294836225,8589767761,17179607041,34359441769

%N a(n) is the largest square with n binary digits.

%F a(n) = 2^n - A056007(n). - _Kevin Ryde_, Oct 13 2022

%F a(n) = A116601(n+2)^2. - _Michel Marcus_, Oct 13 2022

%t Array[Floor[Sqrt[2^# - 1]]^2 &, 33, 3] (* _Michael De Vlieger_, Oct 11 2022 *)

%o (PARI) for (n=3, 35, forstep (k2=2^n-1, 2^(n-1), -1, if (issquare(k2), print1(k2,", "); break)))

%o (PARI) a(n) = if(n%2 == 1, (sqrt(1<<n)\1)^2, ((1 << (n\2)) - 1)^2) \\ _David A. Corneth_, Oct 11 2022

%o (Python)

%o from math import isqrt

%o def A357754(n): return (isqrt((1<<n)-1) if n&1 else (1<<(n>>1))-1)**2 # _Chai Wah Wu_, Oct 13 2022

%Y Cf. A000290, A070939, A056007, A116601, A357753.

%K nonn,base,easy

%O 3,1

%A _Hugo Pfoertner_, Oct 11 2022