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.

A172997 Numbers n such that for p=prime(n), (2p-1)^(2p-1) mod 2^(2p-1) is prime.

Original entry on oeis.org

1, 5, 6, 8, 34, 131
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jan 01 2011

Keywords

Examples

			5 is in the sequence, since prime(5)=11 and (2*11-1)^(2*11-1) mod 2^(2*11-1) = 21^21 mod 2^21 = 1472837 is prime.
		

Crossrefs

Showing 1-1 of 1 results.