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 A269020 #15 Sep 04 2024 15:55:52
%S A269020 1,3,5,6,7,9,10,11,12,13,14,15,16,17,18,20,21,22,23,24,25,26,27,28,29,
%T A269020 30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,52,53,
%U A269020 54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70
%N A269020 a(n) = ceiling(n^(1+1/n)).
%F A269020 a(n) = A059921(n) + 1, n>=2.
%e A269020 a(5)=7 because 5^(6/5) ~ 6.8986; a(6)=9 because 6^(7/6) ~ 8.088.
%t A269020 Table[Ceiling[n^(1 + 1 / n)], {n, 100}] (* _Vincenzo Librandi_, Feb 18 2016 *)
%o A269020 (Magma) [Ceiling(n^(1+1/n)): n in [1..70]]; // _Vincenzo Librandi_, Feb 18 2016
%o A269020 (Python)
%o A269020 from sympy import integer_nthroot
%o A269020 def A269020(n):
%o A269020 a, b = integer_nthroot(n**(n+1),n)
%o A269020 return a+(b^1) # _Chai Wah Wu_, Sep 04 2024
%Y A269020 Cf. A059921 (floor(n^(1+1/n))), A269023 (complementary sequence).
%K A269020 nonn,easy
%O A269020 1,2
%A A269020 _Bob Selcoe_, Feb 17 2016