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.

A156153 Primes p such that p == 2 (mod pi(p)) and pi(p) is prime.

Original entry on oeis.org

5, 41, 367, 9559817, 514275529
Offset: 1

Views

Author

M. F. Hasler, Feb 04 2009

Keywords

Crossrefs

Programs

  • PARI
    p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p-2)%c & next; print1(p, ", ")); \\ Modified by Jinyuan Wang, Feb 22 2020

Formula