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.

Showing 1-1 of 1 results.

A100375 a(n) is the n-th consecutive prime difference divided by the largest power of 2 which divides it.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 3, 1, 3, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 7, 1, 3, 1, 5, 1, 3, 3, 1, 3, 3, 1, 5, 1, 1, 1, 3, 3, 1, 1, 1, 3, 1, 5, 3, 3, 3, 1, 3, 1, 1, 5, 7, 1, 1, 1, 7, 3, 5, 1, 1, 3, 1, 3, 3, 1, 3, 1, 1, 1, 5, 1, 5, 1, 3, 1, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 3, 1, 9, 3, 5, 3, 3, 1, 3
Offset: 1

Views

Author

Labos Elemer, Dec 03 2004

Keywords

Crossrefs

Programs

  • Mathematica
    t1=Table[Prime[n+1]-Prime[n], {n, 1, 256}]; t2=Table[GCD[Prime[n+1]-Prime[n], 65536], {n, 1, 256}];t1/t2
    #/2^IntegerExponent[#,2]&/@Differences[Prime[Range[110]]] (* Harvey P. Dale, Feb 20 2022 *)

Formula

a(n) = A001223(n) / A006519(A001223(n)).
Showing 1-1 of 1 results.