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!)
A265109 a(n) = largest k such that prime(n) + A002110(k) is prime. 2
0, 1, 2, 3, 3, 4, 6, 7, 8, 6, 5, 9, 8, 8, 14, 9, 16, 17, 14, 14, 16, 21, 11, 19, 14, 24, 25, 15, 18, 11, 28, 12, 8, 19, 16, 22, 35, 31, 36, 25, 31, 16, 40, 30, 23, 41, 39, 35, 10, 32, 43, 38, 24, 41, 19, 35, 23, 55, 54, 24, 53, 50, 57, 62, 48, 36, 64, 21, 45, 54 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
a(n) = n-1 iff a(n) is in A035346 for n > 1.
LINKS
FORMULA
a(n) < n.
EXAMPLE
a(4) = 3 because A002110(3) + prime(4) = A002110(3) + 7 = 37 is prime.
PROG
(PARI) a(n) = {my(k=1); while(k, if(ispseudoprime(prod(i=1, n-k, prime(i)) + prime(n)), return(n-k)); k++)}
CROSSREFS
Sequence in context: A102187 A133610 A256211 * A301277 A029033 A041003
KEYWORD
nonn
AUTHOR
Altug Alkan, Dec 01 2015
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 August 17 01:38 EDT 2024. Contains 375198 sequences. (Running on oeis4.)