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 A094299 #10 Apr 06 2021 08:05:55 %S A094299 1,1,2,6,3,15,5,35,280,2520,252,2772,231,3003,429,143,2288,38896, %T A094299 19448,369512,92378,1939938,88179,2028117,676039,16900975,1300075, %U A094299 35102025,5014575,145422675,9694845,300540195,9617286240,3205762080,94287120 %N A094299 a(0) = 1; for n>0, if gcd(a(n-1),n) = 1 then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n. %H A094299 Scott R. Shannon, <a href="/A094299/b094299.txt">Table of n, a(n) for n = 0..1000</a> %e A094299 a(5) = 15 hence a(6) = least integer multiple of 15/6 = 5. %o A094299 (PARI) a=1;for(n=2,35,print1(a,",");d=gcd(a,n);a=if(d==1,a*n,a/d)) %Y A094299 Cf. A055773. %K A094299 nonn,easy %O A094299 0,3 %A A094299 _Amarnath Murthy_, Apr 29 2004 %E A094299 Terms a(14) to a(34) and PARI code from _Klaus Brockhaus_, Apr 29 2004 %E A094299 Extended to include a(0) by _N. J. A. Sloane_, Dec 23 2007