login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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

Table of n, a(n) for n=1..6.

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

Cf. A000040, A000079, A000312, A178537, A178966.

Sequence in context: A134077 A120128 A019149 * A244274 A279664 A230461

Adjacent sequences:  A172994 A172995 A172996 * A172998 A172999 A173000

KEYWORD

nonn

AUTHOR

Juri-Stepan Gerasimov, Jan 01 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 19:58 EST 2019. Contains 319251 sequences. (Running on oeis4.)