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

A276030 Primes p such that A272207(p) = p.

Original entry on oeis.org

2, 11, 131, 251, 491, 599, 1439, 3371, 5639, 5879, 6971, 7079, 8039, 8291, 9839, 10799, 11171, 12119, 14879, 16931, 17159, 18839, 23039, 23159, 25919, 50291, 53411, 53639, 59051, 69371, 74771, 74891, 75239, 81119, 81359, 117839, 119039, 126839, 130811, 131771
Offset: 1

Views

Author

Seiichi Manyama, Sep 10 2016

Keywords

Comments

These terms are the primes prime(A273163(n)) for which A273163(n) = 0.
These terms are the primes for which A276491(p) == 0 (mod p).
These terms are the primes p = prime(n) for which A276664(n) = p.
These terms are the primes prime(A276695(n)) for which A276695(n) = 0.

Examples

			2 = A272207(1) = prime(1),
11 = A272207(5) = prime(5),
131 = A272207(32) = prime(32),
251 = A272207(54) = prime(54).

Crossrefs

Cf. A272207, A273163, A276491, A276664, A276695.
Showing 1-1 of 1 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.