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 A075104 #11 Oct 27 2018 22:42:47
%S A075104 1,1,1,2,1,2,1,1,3,1,1,3,1,1,3,4,1,2,1,4,1,2,1,4,1,2,1,4,1,2,1,1,1,1,
%T A075104 5,1,1,1,1,5,1,1,1,1,5,1,1,1,1,5,1,1,1,1,5,1,1,1,1,5,1,1,1,2,1,6,1,2,
%U A075104 3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2
%N A075104 Greatest common divisor of n and integer part of log_2(n).
%H A075104 Reinhard Zumkeller, <a href="/A075104/b075104.txt">Table of n, a(n) for n = 1..10000</a>
%F A075104 a(n) = gcd(n, A000523(n)).
%t A075104 Table[GCD[n,IntegerPart[Log[2,n]]],{n,110}] (* _Harvey P. Dale_, Apr 21 2016 *)
%o A075104 (Haskell)
%o A075104 a075104 n = gcd n $ a000523 n -- _Reinhard Zumkeller_, Jul 08 2014
%Y A075104 Cf. A000523, A075105, A075106.
%K A075104 nonn
%O A075104 1,4
%A A075104 _Reinhard Zumkeller_, Sep 02 2002