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.

A073274 A000040(n+1) - A073273(n).

Original entry on oeis.org

0, 1, 0, 2, 0, 2, 0, 0, 3, -1, 2, 2, 0, 0, 1, 3, -1, 2, 2, -1, 2, 0, 0, 3, 2, 0, 2, 0, -4, 6, 0, 3, -3, 5, -1, 1, 2, 0, 1, 3, -3, 5, 0, 2, -4, 1, 5, 2, 0, 0, 3, -3, 3, 1, 1, 3, -1, 2, 2, -3, -1, 6, 2, 0, -4, 5, -1, 5, 0, 0, 0, 2, 1, 2, 0, 0, 3, -1, 0, 5, -3, 5, -1, 2, 0, 0, 3, 2, 0, -3, 3, 3, -1, 3
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 22 2002

Keywords

Examples

			For n=11, A000040(11)*A000040(13) = 31*41 = 1271 = 35*35+46, therefore A073273(11)=35; a(11) = A000040(12)-A073273(11) = 37-35 = +2.
		

Crossrefs

Cf. A073272.

Programs

  • PARI
    vector(80, n, prime(n+1) - floor(sqrt(prime(n)*prime(n+2)))) \\ Michel Marcus, Jun 02 2015
    
  • PARI
    a(n,p=prime(n))=my(q=nextprime(p+1),r=nextprime(q+1)); q - sqrtint(p*r) \\ Charles R Greathouse IV, Jun 02 2015