OFFSET
1,2
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
MAPLE
a := proc(n) option remember: if n=1 then RETURN(1) fi: if isprime(a(n-1)+n) then RETURN(a(n-1)+n) else RETURN(a(n-1)) fi: end: for n from 1 to 100 do printf(`%d, `, a(n)) od: # James A. Sellers, May 19 2003
MATHEMATICA
a083743[n_] := Block[{i, t = Table[1, {n}]},
For[i = 1, i < n,
If[PrimeQ[t[[i - 1]] + i], t[[i]] = t[[i - 1]] + i,
t[[i]] = t[[i - 1]]], i++]; t]; a083743[60] (* Michael De Vlieger, Dec 24 2014 *)
nxt[{n_, a_}]:={n+1, If[PrimeQ[a+n+1], a+n+1, a]}; NestList[nxt, {1, 1}, 60][[All, 2]] (* Harvey P. Dale, Apr 28 2018 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Amarnath Murthy, May 05 2003
EXTENSIONS
More terms from James A. Sellers, May 19 2003
STATUS
approved