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.

A156155 Numbers k such that prime(prime(k)) = 2 (mod prime(k)), where prime(k) = A000040(k) is the k-th prime.

Original entry on oeis.org

2, 6, 21, 51892, 1686970
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( primepi(c)","))

Formula

a(n) = A000720(A156154(n)).

Extensions

a(5) from Jinyuan Wang, Feb 22 2020