The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A307625 Numbers k such that q = 2^k - 2^m + 1 is prime, where m = A270096(k). 1
1, 2, 3, 4, 5, 6, 7, 10, 12, 13, 14, 16, 17, 19, 22, 31, 39, 45, 61, 76, 89, 94, 100, 102, 107, 122, 127, 294, 360, 430, 460, 521, 607, 639, 694, 732, 737, 952, 1279, 1581, 1983, 2061, 2203, 2281, 2319, 2410, 2530, 3217, 4253, 4423, 5324, 6846, 7011, 9615, 9689, 9904, 9941, 10841, 11213 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
All primes in the sequence are the Mersenne exponents A000043.
It seems that the composite terms are composite numbers k <> 8 such that A307590(k) = 2.
LINKS
FORMULA
q == 1 (mod k).
MATHEMATICA
b[n_] := Module[{k = 0}, While[PowerMod[2, n, n] != PowerMod[2, k, n], k++]; k]; aQ[n_] := PrimeQ[2^n - 2^b[n] + 1]; Select[Range[5000], aQ] (* Amiram Eldar, Apr 19 2019 *)
PROG
(PARI) f(n) = {my(m = 0); while (Mod(2, n)^m != 2^n, m++); m; } \\ A270096
isok(n) = my(m = f(n)); isprime(2^n - 2^m + 1); \\ Michel Marcus, Apr 23 2019
CROSSREFS
Sequence in context: A080571 A165805 A319975 * A165722 A082400 A072993
KEYWORD
nonn
AUTHOR
Thomas Ordowski, Apr 19 2019
EXTENSIONS
More terms from Amiram Eldar, Apr 19 2019
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 May 31 11:00 EDT 2024. Contains 372981 sequences. (Running on oeis4.)