[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
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 WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified October 6 20:43 EDT 2024. Contains 376583 sequences.
License Agreements, Terms of Use, Privacy Policy