Michael De Vlieger, <a href="/A369685/b369685_1.txt">Table of n, a(n) for n = 0..6187</a>
Michael De Vlieger, <a href="/A369685/b369685_1.txt">Table of n, a(n) for n = 0..6187</a>
reviewed
approved
proposed
reviewed
editing
proposed
nonn,more,changed
proposed
editing
editing
proposed
nn = 40; c[_] = False; q[_] = 1;
Array[Set[{a[#], c[#]}, {1, True}] &, 2];
Set[{i, j}, {1, 2}]; m = 2; u = 3;
Do[
(k = q[#]; While[c[k #], k++]; k *= #; While[c[# q[#]], q[#]++]) &[
(p = 2; While[Divisible[i j, p], p = NextPrime[p]]; p)];
Set[{a[n], c[k], i, j, m}, {m, True, j, k, #}] &[LCM[m, k]];
If[k == u, While[c[u], u++]], {n, 3, nn}];
Array[a, nn] (* Michael De Vlieger, Jan 29 2024 *)
Michael De Vlieger, <a href="/A369685/b369685_1.txt">Table of n, a(n) for n = 0..6187</a>
1, 1, 2, 6, 30, 60, 60, 60, 420, 1260, 2520, 2520, 2520, 27720, 27720, 27720, 27720, 27720, 138600, 138600, 138600, 138600, 138600, 138600, 277200, 277200, 277200, 277200, 277200, 277200, 1940400, 25225200, 75675600, 75675600, 75675600, 75675600, 75675600, 75675600, 151351200, 151351200, 151351200, 15135200, 15135200, 15135200
1, 1, 2, 6, 30, 60, 60, 60, 420, 1260, 2520, 2520, 2520, 27720, 27720, 27720, 27720, 27720, 138600, 138600, 138600, 138600, 138600, 138600, 277200, 277200, 277200, 277200, 277200, 277200, 1940400, 25225200, 75675600, 75675600, 75675600, 75675600, 75675600, 75675600, 151351200, 151351200, 151351200, 15135200, 15135200, 15135200