cp's OEIS Frontend

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.

A369685 Least common multiple of the first n terms of A359804.

Original entry on oeis.org

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
Offset: 0

Views

Author

David James Sycamore, Jan 28 2024

Keywords

Crossrefs

Programs

  • Mathematica
    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 *)

Formula

a(0) = 1, and for n >0, a(n) = lcm(A359804(n), a(n-1)).