OFFSET
1,2
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
N:= 100: # for a(1)..a(N)
A[1]:= 1: A[2]:= 2:
for n from 3 to N do
t:= (A[n-1]+1)*(A[n-2]+1);
for k from A[n-1]+1 do
if igcd(k, t)=1 then
A[n]:= k;
break
fi
od;
od:
[seq(A[i], i=1..N)]: # Robert Israel, Sep 22 2019
MATHEMATICA
a = {1, 2}; For[n = 3, n < 80, n++, i = a[[ -1]] + 1; While[GCD[(a[[ -1]] + 1)*(a[[ -2]] + 1), i] > 1, i++ ]; AppendTo[a, i]]; a (* Stefan Steinerberger, Apr 26 2008 *)
nxt[{a_, b_}]:=Module[{k=b+1, c=(a+1)(b+1)}, While[!CoprimeQ[k, c], k++]; {b, k}]; NestList[nxt, {1, 2}, 60][[;; , 1]] (* Harvey P. Dale, Jan 09 2026 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Leroy Quet, Apr 24 2008
EXTENSIONS
More terms from Stefan Steinerberger, Apr 26 2008
STATUS
approved
