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 A363828 #12 Oct 22 2023 17:01:15
%S A363828 1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,4,1,2,1,4,1,2,1,4,1,2,1,4,1,2,
%T A363828 1,4,1,2,1,4,1,2,1,4,1,2,1,4,1,2,1,4,1,2,1,4,1,2,1,4,1,2,1,4,1,2,1,4,
%U A363828 1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,8,1,2,1,4
%N A363828 Highest power of 2 dividing n which is < sqrt(n), for n >= 2; a(1) = 1.
%t A363828 Join[{1}, Table[Last[Select[Divisors[n], # < Sqrt[n] && IntegerQ[Log[2, #]] &]], {n, 2, 100}]]
%t A363828 a[n_] := 2^Min[IntegerExponent[n, 2], Ceiling[Log2[n]/2] - 1]; a[1] = 1; Array[a, 100] (* _Amiram Eldar_, Oct 19 2023 *)
%o A363828 (PARI) a(n) = if (n==1, 1, vecmax(select(x->((x^2 < n) && (2^logint(x,2)==x)), divisors(n)))); \\ _Michel Marcus_, Oct 19 2023
%Y A363828 Cf. A006519, A033676, A135517, A363827.
%K A363828 nonn
%O A363828 1,6
%A A363828 _Ilya Gutkovskiy_, Oct 19 2023