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 A008339 #30 Jul 08 2025 01:02:56
%S A008339 1,1,2,6,6,30,5,35,280,2520,252,2772,231,3003,858,1430,5720,97240,
%T A008339 437580,8314020,415701,969969,176358,4056234,2704156,67603900,2600150,
%U A008339 70204050,10029150,290845350,9694845,300540195,9617286240,35263382880,1037158320
%N A008339 a(1)=1; for n >= 1, a(n+1) = lcm(a(n),n) / gcd(a(n),n).
%C A008339 a(n+1) = Product(A098666(n,k): 1<=k<=n), row-products of triangle A098666. - _Reinhard Zumkeller_, Sep 20 2004
%C A008339 a(n+1) is divisible by all primes in (n/2, n]; thus lim_{n->infinity} a(n) = infinity. - _Franklin T. Adams-Watters_, Dec 13 2006
%H A008339 Vincenzo Librandi, <a href="/A008339/b008339.txt">Table of n, a(n) for n = 1..1000</a>
%F A008339 a(1) = 1, a(n) = a(n-1)*r/s where y is the largest divisor of a(n-1) with r*s = n. - _Amarnath Murthy_, Jul 01 2003
%F A008339 a(1) = 1, a(n+1) = a(n)*n/gcd(a(n),n)^2. - _Franklin T. Adams-Watters_, Dec 13 2006
%p A008339 A008339 := proc(n) option remember; if n = 1 then 1 else lcm(A008339(n-1), n-1)/gcd(A008339(n-1), n-1); fi; end;
%t A008339 FoldList[ LCM[ #1, #2 ]/GCD[ #1, #2 ]&, 1, Range[ 30 ] ] (* _Olivier Gérard_, Aug 15 1997 *)
%Y A008339 Cf. A249831.
%K A008339 nonn
%O A008339 1,3
%A A008339 _N. J. A. Sloane_