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 A092427 #20 Apr 29 2023 00:06:07
%S A092427 2,6,12,12,12,24,24,36,40,45,48,60,60,60,72,72,72,80,80,90,90,120,120,
%T A092427 120,120,120,120,120,144,144,144,144,144,144,144,180,180,180,180,180,
%U A092427 180,180,180,180,240,240,240,240,240,240,240,240,240,240,240,240,240
%N A092427 Least k > 1 such that k^n divides (k-1)!.
%C A092427 Is 45 the only odd number in this sequence? - _Derek Orr_, Apr 16 2015
%H A092427 Michael De Vlieger, <a href="/A092427/b092427.txt">Table of n, a(n) for n = 0..1000</a>
%F A092427 Does lim_{n->oo} a(n)/n exist?
%t A092427 Table[k = 2; While[Mod[(k - 1)!, k^n] != 0, k++]; k, {n, 0, 60}] (* _Michael De Vlieger_, Apr 16 2015 *)
%o A092427 (PARI) a(n)=if(n<0,0,k=2;while((k-1)!%(k^n)>0,k++);k)
%Y A092427 A061770 gives values of n such that a(n) > a(n-1).
%K A092427 nonn
%O A092427 0,1
%A A092427 _Benoit Cloitre_, Mar 22 2004
%E A092427 Name edited by _Derek Orr_, Apr 16 2015