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!)
A282194 a(n) = smallest positive k such that 2*n + 2^k + 1 is composite. 1
3, 5, 2, 1, 4, 2, 1, 7, 2, 1, 2, 1, 1, 3, 2, 1, 1, 2, 1, 4, 2, 1, 2, 1, 1, 2, 1, 1, 3, 2, 1, 1, 2, 1, 3, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 4, 2, 1, 4, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 4, 2, 1, 3, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Least k such that a(k) = n are 3, 2, 0, 4, 1, 112, 7, 32917, 802, 9712, 1198673602 for the initial terms.
LINKS
EXAMPLE
a(1) = 5 because 3 + 2^k is prime for 0 < k < 5 and 3 + 2^5 = 35 is composite.
MATHEMATICA
spk[n_]:=Module[{k=1}, While[!CompositeQ[2n+2^k+1], k++]; k]; Array[spk, 110, 0] (* Harvey P. Dale, Apr 26 2017 *)
PROG
(PARI) a(n) = my(k=1); while(isprime(2*n+2^k+1), k++); k;
CROSSREFS
Sequence in context: A197521 A161865 A145325 * A138508 A353712 A308180
KEYWORD
nonn
AUTHOR
Altug Alkan, Feb 15 2017
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 March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)