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).
LINKS
Benoit Cloitre, 10 conjectures in additive number theory, arXiv:1101.4274 [math.NT], 2011.
FORMULA
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
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 16 2011
EXTENSIONS
More terms from Jinyuan Wang, Aug 14 2022
STATUS
approved