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 A059921 #21 Sep 04 2024 16:06:00
%S A059921 1,2,4,5,6,8,9,10,11,12,13,14,15,16,17,19,20,21,22,23,24,25,26,27,28,
%T A059921 29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,51,52,
%U A059921 53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75
%N A059921 a(n) = floor(n^((n+1)/n)).
%C A059921 Infinitely many integers are missing, starting 3, 7, 18, 50, 140; their ratios tend to e. - _Charles R Greathouse IV_, Aug 21 2011
%H A059921 Harry J. Smith, <a href="/A059921/b059921.txt">Table of n, a(n) for n = 1..1000</a>
%F A059921 a(n) = floor(n^(1+1/n)). - _M. F. Hasler_, Nov 03 2014
%t A059921 Table[Floor[n^((n+1)/n)],{n,80}] (* _Harvey P. Dale_, Jul 22 2019 *)
%o A059921 (PARI) { for (n=1, 1000, write("b059921.txt", n, " ", floor(n^((n + 1)/n))); ) } \\ _Harry J. Smith_, Jun 30 2009
%o A059921 (PARI) A059921(n)=n^(1+1/n)\1 \\ _M. F. Hasler_, Nov 03 2014
%o A059921 (Python)
%o A059921 from sympy import integer_nthroot
%o A059921 def A059921(n): return integer_nthroot(n**(n+1),n)[0] # _Chai Wah Wu_, Sep 04 2024
%Y A059921 Cf. A249669.
%K A059921 easy,nonn
%O A059921 1,2
%A A059921 _Fabian Rothelius_, Feb 09 2001