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 A102068 #19 Feb 16 2025 08:32:55
%S A102068 1,2,6,2,120,6,5040,2,6,120,39916800,6,6227020800,5040,120,2,
%T A102068 355687428096000,6,121645100408832000,120,5040,39916800,
%U A102068 25852016738884976640000,6,120,6227020800,6,5040,8841761993739701954543616000000,120
%N A102068 a(n) = P(n)!, where P(n) is the largest prime factor of n (with a(1) = 1).
%C A102068 P(n)! is a multiple of n, for almost all n. The exceptions are A057109.
%H A102068 Alois P. Heinz, <a href="/A102068/b102068.txt">Table of n, a(n) for n = 1..456</a>
%H A102068 Paul Erdős and Ilias Kastanas, <a href="https://www.jstor.org/stable/2324376">Solution 6674: The smallest factorial that is a multiple of n</a>, Amer. Math. Monthly 101 (1994) 179.
%H A102068 A. Ivic, <a href="https://arxiv.org/abs/math/0311056">On a problem of Erdos involving the largest prime factor of n</a>, arXiv:math/0311056 [math.NT], 2003-2004.
%H A102068 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GreatestPrimeFactor.html">Greatest Prime Factor</a>
%H A102068 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers.</a>
%F A102068 a(n) = A000142(A006530(n)) = A000040(A061395(n))!.
%e A102068 P(12)! = 3! = 6.
%t A102068 Table[FactorInteger[n][[-1,1]]!,{n,30}] (* _Harvey P. Dale_, Jan 29 2014 *)
%o A102068 (PARI) a(n) = if (n==1, 1, vecmax(factor(n)[,1])!); \\ _Michel Marcus_, Sep 24 2022
%Y A102068 Cf. A000040, A000142, A006530, A057109, A061395, A102067.
%K A102068 nonn
%O A102068 1,2
%A A102068 _Jonathan Sondow_, Dec 28 2004