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 A000799 M0239 N0082 #60 Sep 08 2022 08:44:28
%S A000799 2,2,2,4,6,10,18,32,56,102,186,341,630,1170,2184,4096,7710,14563,
%T A000799 27594,52428,99864,190650,364722,699050,1342177,2581110,4971026,
%U A000799 9586980,18512790,35791394,69273666,134217728,260301048,505290270,981706810,1908874353
%N A000799 a(n) = floor(2^n / n).
%D A000799 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000799 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000799 Vincenzo Librandi, <a href="/A000799/b000799.txt">Table of n, a(n) for n = 1..300</a>
%F A000799 Sum_{n>=1} 1/a(n) = A193359. - _Amiram Eldar_, Apr 03 2021
%p A000799 seq(floor(2^n/n),n=1..40); # _Muniru A Asiru_, Oct 20 2018
%t A000799 Table[Quotient[2^n,n],{n,60}] (* _Vladimir Joseph Stephan Orlovsky_, May 07 2011 *)
%o A000799 (PARI) a(n)=1<<n\n
%o A000799 (Magma) [2^n div n : n in [1..40]]; // _Vincenzo Librandi_, Oct 14 2018
%o A000799 (GAP) List([1..40],n->Int(2^n/n)); # _Muniru A Asiru_, Oct 20 2018
%o A000799 (Python) for n in range(1, 40): print(int(2**n / n), end=", ") # _Stefano Spezia_, Oct 20 2018
%Y A000799 Cf. A000801, A053638, A065482, A082482, A071354, A193359.
%K A000799 nonn,easy
%O A000799 1,1
%A A000799 _N. J. A. Sloane_