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-3 of 3 results.

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

Cf. A023144, A156152, A156154, A156155.

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

a(n) = A000040(A156154(n)) = A000040(A000040(A156155(n))).

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))

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

Cf. A023144, A156154.

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
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.