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