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.

A083551 Least common multiple of 2 consecutive prime differences, of two successive terms of A001223.

Original entry on oeis.org

2, 2, 4, 4, 4, 4, 4, 12, 6, 6, 12, 4, 4, 12, 6, 6, 6, 12, 4, 6, 12, 12, 24, 8, 4, 4, 4, 4, 28, 28, 12, 6, 10, 10, 6, 6, 12, 12, 6, 6, 10, 10, 4, 4, 12, 12, 12, 4, 4, 12, 6, 10, 30, 6, 6, 6, 6, 12, 4, 10, 70, 28, 4, 4, 28, 42, 30, 10, 4, 12, 24, 24, 6, 12, 12, 24, 8, 8, 40, 10, 10, 10, 6, 12
Offset: 1

Views

Author

Labos Elemer, May 22 2003

Keywords

Crossrefs

Programs

  • Mathematica
    f[x_] := Prime[x+1]-Prime[x];  Table[LCM[f[w+1], f[w]], {w, 1, 128}]
    Table[LCM[(Prime[n + 1] - Prime[n]), Prime[n + 2] - Prime[n + 1]], {n, 100}] (* Vincenzo Librandi, Mar 15 2018 *)
    LCM@@#&/@Partition[Differences[Prime[Range[90]]],2,1] (* Harvey P. Dale, Oct 11 2020 *)

Formula

a(n) = lcm(A001223(n), A001223(n+1)).