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 A262060 #15 Oct 23 2015 03:55:25
%S A262060 2,2,4913,463584,58571590,9380523077,1831736082750,423908600424675,
%T A262060 113798703080610442,34848887401383308294,12011778862556061365985,
%U A262060 4609276407921507486293833,1951202873990586514532224545,904205931392036935959059378623
%N A262060 Least integer k such that k^(1/n)/log(k) exceeds 2.
%H A262060 R. J. Mathar, <a href="/A262060/b262060.txt">Table of n, a(n) for n = 1..45</a>
%t A262060 f[n_] := f[n] = Block[{k = f[n - 1]}, While[2 > k^(1/n)/Log[k], k++]; k]; f[1] = 2; Array[f, 6]
%o A262060 (PARI) a(n) = {my(k = 2); while(sqrtn(k,n)/log(k) <= 2, k++); k;} \\ _Michel Marcus_, Sep 10 2015
%Y A262060 Cf. A084238, A088346, A262058, A262059.
%K A262060 nonn
%O A262060 1,1
%A A262060 _Robert G. Wilson v_, Sep 09 2015
%E A262060 a(14) from _Jon E. Schoenfield_, Sep 12 2015