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.

A087032 a(n) = 1 if 2*A151800(n) - n is prime, otherwise 0, where A151800(n) is the smallest prime > n.

Original entry on oeis.org

1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0
Offset: 1

Views

Author

Zak Seidov, Jul 31 2003

Keywords

Comments

There is no subsequence of two ones; number of zeros in each group is odd, see A087033.

Examples

			a(1)=1 because the smallest prime > 1 is 2 and 2*2-1=3 is prime.
		

Crossrefs

Programs

  • Mathematica
    bb={}; Do[bb={bb, If[PrimeQ[2(Prime[PrimePi[n]+1])-n], 1, 0]}, {n, 1000}]; Flatten[bb]
  • PARI
    A087032(n) = isprime((2*nextprime(1+n))-n); \\ Antti Karttunen, Oct 09 2018

Formula

a(n) = 1 if A087030(n) is prime, 0 if it is composite.
a(n) = A010051((2*A151800(n))-n). - Antti Karttunen, Oct 09 2018

Extensions

Definition edited by Antti Karttunen, Oct 09 2018
Showing 1-1 of 1 results.