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 A214449 #7 Jul 25 2012 17:57:32
%S A214449 1,2,3,3,4,5,6,6,7,8,9,10,10,11,12,13,14,14,15,16,17,18,18,19,20,21,
%T A214449 22,22,23,24,25,26,27,27,28,29,30,31,32,32,33,34,35,36,37,37,38,39,40,
%U A214449 41,42,42,43,44,45,46,47,47,48,49,50,51,52
%N A214449 Least m>0 such that n! <= m^m.
%C A214449 Conjecture: this sequence results from A118168 by deleting the first two 1s.
%H A214449 Clark Kimberling, <a href="/A214449/b214449.txt">Table of n, a(n) for n = 1..1000</a>
%e A214449 a(4) = 3 because 2^2 < 4! < 3^3.
%t A214449 Table[m = 1; While[n! > m^m, m++]; m, {n, 1, 100}]
%Y A214449 Cf. A214046.
%K A214449 nonn,easy
%O A214449 1,2
%A A214449 _Clark Kimberling_, Jul 18 2012