login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A172997 Numbers n such that for p=prime(n), (2p-1)^(2p-1) mod 2^(2p-1) is prime. 0
1, 5, 6, 8, 34, 131 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
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
Sequence in context: A134077 A120128 A019149 * A244274 A279664 A230461
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)