This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A186267 Generating prime triples. a(n)=b_f(n) where f is the 3-periodic sequence [-1,1,5]. 0
 2, 11, 19, 41, 71, 107, 191, 301, 431, 565, 857, 1133, 1325, 2657, 5231, 10457, 19421, 29567, 54497, 105527, 211061, 408431, 802127, 1600217, 3200201, 6393911, 12783497, 25566677, 51095411 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Let u(1)=1 and u(n)=abs(u(n-1)-gcd(u(n-1),n+f(n)) where f(n) is a periodic sequence with period [f(1),f(2),...,f(beta)]. Then (b_f(k))_{k>=1} is the sequence of integers such that u(b_f(k))=0. We conjecture that for k large enough b_f(k)+1+f(i) is simultaneously prime for i=1,2,...,beta. Here f is a period 3 sequence with period [-1,1,5]. It appears [a(n),a(n)+2,a(n)+6] is a prime triple for n>=14 (a(n)>=2657). REFERENCES B. Cloitre, 10 conjectures in additive number theory, preprint 2011 LINKS B. Cloitre, 10 conjectures in additive number theory FORMULA we conjecture a(n) is asymptotic to c*2^n with c>0. PROG (PARI)f(n)=[-1, 1, 5][(n+2)%3+1]//a=1; for(n=2, 1000000000, t=a; a=abs(a-gcd(a, n+f(n))); if(a==0; print1(n, ", "))) CROSSREFS Sequence in context: A154765 A163997 A067931 * A067660 A235472 A217308 Adjacent sequences:  A186264 A186265 A186266 * A186268 A186269 A186270 KEYWORD nonn AUTHOR Benoit Cloitre, Feb 16 2011 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 March 19 11:10 EDT 2019. Contains 321329 sequences. (Running on oeis4.)