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 A065067 #18 Dec 21 2019 16:28:59
%S A065067 1,2,3,2,3,2,3,3,2,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,2,3,3,2,3,3,3,2,3,3,
%T A065067 2,3,3,3,2,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,
%U A065067 3,2,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3
%N A065067 First differences of A065027.
%H A065067 Harry J. Smith, <a href="/A065067/b065067.txt">Table of n, a(n) for n = 0..1000</a>
%F A065067 a(n) = A065027(n+1) - A065027(n).
%t A065067 f[1] = 2; f[n_] := f[n] = Block[{k = f[n - 1]}, While[k! <= n^k, k++ ]; k]; t = Table[ f[n], {n, 1, 110}]; Drop[t, 1] - Drop[t, -1]
%t A065067 sm0[n_]:=Module[{m=1},While[n^m>=m!,m++];m]; Differences[Array[sm0,120]] (* _Harvey P. Dale_, Jan 24 2018 *)
%o A065067 (PARI) { m=1; p=2; for (n=1, 1000, until ((n + 1)^m < m!, m++); a=m - p; p=m; write("b065067.txt", n, " ", a) ) } \\ _Harry J. Smith_, Oct 05 2009
%Y A065067 Cf. A065027.
%K A065067 nonn
%O A065067 0,2
%A A065067 _Floor van Lamoen_, Nov 07 2001
%E A065067 More terms from _Robert G. Wilson v_, Jul 12 2003
%E A065067 a(0)=1 prepended by _Alois P. Heinz_, Dec 21 2019