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!)
A239730 Number of values of k such that 2^k - (6n+3) and (6n+3)*2^k + 1 are both prime, k < 6n+3. 0
0, 0, 1, 3, 5, 3, 1, 3, 1, 5, 2, 1, 3, 2, 1, 1, 2, 5, 0, 3, 0, 1, 3, 2, 3, 2, 1, 5, 1, 1, 0, 0, 4, 1, 2, 2, 2, 2, 4, 1, 3, 1, 1, 3, 1, 4, 0, 1, 0, 2, 1, 0, 3, 0, 1, 2, 1, 3, 1, 3, 1, 1, 4, 2, 1, 1, 1, 4, 2, 2, 4, 3, 1, 1, 3, 4, 6, 4, 1, 1, 1, 1, 1, 1, 0, 5, 0, 2, 2, 2, 1, 1, 2, 1, 1, 0, 1, 1, 0, 2, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
EXAMPLE
a(2) = 1 because
1) 2^10 - (6*2+3) = 1009 and (6*2+3)*2^10 + 1 = 15361 for k = 10 < (6*2+3).
a(3) = 3 because
1) 2^5 - (6*3+3) = 11 and (6*3+3)*2^5 + 1 = 673 for k = 5 < (6*3+3);
2) 2^7 - (6*3+3) = 107 and (6*3+3)*2^7 + 1 = 2689 for k = 7 < (6*3+3);
3) 2^9 - (6*3+3) = 491 and (6*3+3)*2^9 + 1 = 10753 for k = 9 < (6*3+3).
PROG
(PARI) for(n=0, 120, m=0; for(k=0, 6*n+2, if(isprime(2^k-(6*n+3)) && isprime((6*n+3)*2^k+1), m++)); print1(m, ", ")) \\ Colin Barker, Mar 26 2014
CROSSREFS
Cf. A239476.
Sequence in context: A076824 A103728 A243533 * A287765 A162777 A241014
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(24), a(76) and a(86) corrected by Colin Barker, Mar 26 2014
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 15 14:34 EDT 2024. Contains 372540 sequences. (Running on oeis4.)