The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143429 Least a(n) prime == 1 mod 6 such that q(n)*(q(n)+a(n))-1 is prime with q(i)=i-th prime == -1 mod 6. 4
 7, 7, 13, 13, 13, 13, 13, 31, 31, 19, 31, 7, 19, 7, 43, 7, 7, 13, 13, 7, 13, 61, 43, 7, 31, 37, 37, 13, 151, 19, 13, 13, 7, 67, 13, 7, 19, 13, 7, 13, 43, 73, 43, 19, 13, 67, 43, 13, 13, 7, 7, 13, 31, 73, 19, 7, 31, 43, 31, 67, 7, 31, 37, 13, 31, 7, 37, 7, 103, 43, 13, 13, 19, 13, 43, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Pierre CAMI, Table of n, a(n) for n = 1..10000 EXAMPLE q(1)=5 5*(5+7)-1=59 prime so a(1)=7 q(2)=11 11*(11+7)=197 prime so a(2)=7 CROSSREFS Cf. A143427, A143428, A143430. Sequence in context: A266116 A344329 A116934 * A168301 A335895 A072821 Adjacent sequences: A143426 A143427 A143428 * A143430 A143431 A143432 KEYWORD nonn AUTHOR Pierre CAMI, Aug 14 2008 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.

Last modified September 22 11:05 EDT 2023. Contains 365520 sequences. (Running on oeis4.)