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.

A058255 Distinct values of lcm_{i=1..n} (p(i)-1), where p() are the primes.

Original entry on oeis.org

1, 2, 4, 12, 60, 240, 720, 7920, 55440, 1275120, 16576560, 480720240, 19709529840, 39419059680, 197095298400, 3350620072800, 177582863858400, 532748591575200, 19711697888282400, 59135093664847200
Offset: 1

Views

Author

Labos Elemer, Dec 06 2000

Keywords

Comments

The prime A095365(n) is the least prime yielding an LCM of a(n). This sequence and A095365 are related to A095366. - T. D. Noe, Jun 04 2004

Examples

			For p = 29, 31, 37, 41, 43 these LCMs are equal to 55440 = 11*7! = lcm[1, 2, 4, 6, 10, 12, 16, 22, 28, 30, 36, 40, 42] = lcm[1, 2, 4, 6, 10, 12, 16, 22, 28]. The values was put on the stage only once. Repetitions skipped.
		

Crossrefs

A058254 with duplicates removed.
Cf. A095366 (least k > 1 such that k divides 1^n + 2^n + ... + (k-1)^n).

Programs

  • Mathematica
    Union@ Table[LCM @@ (Prime@ Range[1, n] - 1), {n, 38}] (* Michael De Vlieger, Dec 06 2018 *)