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.

A348677 a(n) is the difference between A262275(n) and the next lower prime.

Original entry on oeis.org

1, 4, 4, 4, 6, 4, 2, 14, 6, 10, 12, 2, 6, 2, 4, 8, 4, 4, 6, 6, 6, 10, 4, 6, 4, 10, 2, 14, 14, 8, 10, 2, 18, 8, 8, 4, 10, 4, 8, 12, 6, 14, 2, 2, 2, 8, 12, 6, 10, 10, 12, 10, 8, 2, 2, 4, 6, 6, 16, 14, 6, 6, 2, 10, 6, 2, 8, 6, 20, 2, 8, 28, 6, 16, 2, 6, 2, 10, 6, 22, 4, 6, 4, 14, 6, 2
Offset: 1

Views

Author

Michael P. May, Oct 30 2021

Keywords

Comments

This sequence can be used as an alternate method of approximating the prime-counting function pi(n).

Examples

			For n = 3, a(3) = 17 - 13 = 4.
		

Crossrefs

Programs

  • Maple
    b:= proc(n) option remember;
           `if`(isprime(n), 1+b(numtheory[pi](n)), 0)
        end:
    g:= proc(n) option remember; local p; p:= g(n-1);
          do p:= nextprime(p);
             if b(p)::even then break fi
          od; p
        end: g(1):=3:
    a:= n-> (t-> t-prevprime(t))(g(n)):
    seq(a(n), n=1..86);  # Alois P. Heinz, Jan 06 2022
  • Mathematica
    fQ[n_]:=If[!PrimeQ[n]||(PrimeQ[n]&&FreeQ[lst,PrimePi[n]]),AppendTo[lst,n]];k=2;lst={1};While[k<10000000,fQ@k;k++];tab1=Select[lst,PrimeQ]
    lowerP[n_]:=Module[{m}, m=n;While[!PrimeQ[m-1],m--]; m-1]
    tab2=lowerP/@tab1
    tab3=tab1-tab2

Formula

a(n) = p_p'(n) - p_(p'(n) - 1), where p' is a prime number in the sequence A333242, p_p' is a prime number with index in A333242 (forms the prime number sequence A262275), and p_(p'(n)-1) is a prime number which is the next lower prime than those in A262275.
a(n) = A001223(A000720(A262275(n)) - 1).
a(n) = A262275(n) - A151799(A262275(n)). - Alois P. Heinz, Jan 06 2022