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.

A341827 a(n) is the distance from n to its more distant neighboring prime.

Original entry on oeis.org

2, 1, 2, 1, 4, 3, 2, 3, 4, 1, 4, 3, 2, 3, 4, 1, 4, 3, 2, 3, 6, 5, 4, 3, 4, 5, 6, 1, 6, 5, 4, 3, 4, 5, 6, 3, 2, 3, 4, 1, 4, 3, 2, 3, 6, 5, 4, 3, 4, 5, 6, 5, 4, 3, 4, 5, 6, 1, 6, 5, 4, 3, 4, 5, 6, 3, 2, 3, 4, 1, 6, 5, 4, 3, 4, 5, 6, 3, 2, 3, 6, 5, 4, 3, 4, 5, 8
Offset: 3

Views

Author

Ya-Ping Lu, Feb 20 2021

Keywords

Comments

a(n) is even if n is odd and vice versa. It seems that all records are even.
n - 1 and n + 1 are twin primes if a(n) = 1.
n - 2 and n + 2 are cousin primes for n > 3 if a(n) = 2.
n - 3 and n + 3 are sexy primes if a(n) = A051700(n) = 3.

Crossrefs

Programs

  • Mathematica
    Array[Max[#1 - #2, #3 - #1] & @@ Prepend[NextPrime[#, {-1, 1}], #] &, 105, 3] (* Michael De Vlieger, Mar 17 2021 *)
  • PARI
    for(n=3,88,my(d1=n-precprime(n-1),d2=nextprime(n+1)-n);print1(max(d1,d2),", ")) \\ Hugo Pfoertner, Mar 10 2021
  • Python
    from sympy import prevprime, nextprime
    for n in range(3, 1001):
        prevp = prevprime(n); nextp = nextprime(n)
        print(max(n - prevp, nextp - n))
    

Formula

a(n) = max{n - prevprime(n), nextprime(n) - n}.