This site is supported by donations to The OEIS Foundation.

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!)
 A232084 Least k such that prime(n) + 2^(k+L) - 2^L is a prime, where L is the length of binary representation of prime(n): L = A070939(A000040(n)). a(n) = -1 if no such k exists. 0
 1, 1, 2, 2, 1, 2, 4, 4, 1, 2, 1, 2, 1, 2, 4, 2, 3, 4, 1, 2, 2, 1, 5, 4, 1, 2, 2, 4, 1, 6, 18, 20, 2, 4, 2, 3, 1, 4, 2, 2, 3, 6, 1, 12, 2, 1, 1, 96, 2, 4, 4, 2, 2, 1, 3, 3, 4, 6, 6, 4, 3, 6, 1, 4, 1, 2, 2, 1, 56, 2, 3, 8, 4, 4, 3, 4, 2, 4, 4, 3, 4, 4, 18, 20, 2, 8, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,3 COMMENTS Least number of 1's that must be prepended to the binary representation of prime(n) such that the result is another prime. Prime(n) is in A065047 if and only if a(n) = 1. LINKS EXAMPLE a(6) = 1 because 13 in binary is 1101, and 29 (11101 in binary) is a prime. a(7) = 2 because 17 in binary is 10001, and 113 (1110001 in binary) is a prime. a(8) = 4 because 19 in binary is 10011, and 499 (111110011 in binary) is a prime. CROSSREFS Cf. A000040, A070939, A065047, A094076, A023758. Sequence in context: A035374 A229219 A048299 * A261359 A217680 A144218 Adjacent sequences:  A232081 A232082 A232083 * A232085 A232086 A232087 KEYWORD nonn,base,less AUTHOR Alex Ratushnyak, Nov 17 2013 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.

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