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.

A156149 Primes p such that prime(p)+2 = 0 (mod p), where prime(p)=A000040(p) is the p-th prime.

Original entry on oeis.org

11, 71, 637319, 637327
Offset: 1

Views

Author

M. F. Hasler, Feb 04 2009

Keywords

Comments

The subsequence of primes in A092044.

Crossrefs

Cf. A156154.

Programs

  • PARI
    p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p+2)%c & next; print1( c","))

Formula

a(n) = A000720(A156150(n)) = A000040(A156148(n))