OFFSET
1,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..350
J. L. Schiffman, Exploring the Fibonacci sequence of order two with CAS technology, Paper C027, Electronic Proceedings of the Twenty-fourth Annual International Conference on Technology in Collegiate Mathematics, Orlando, Florida, March 22-25, 2012.
MAPLE
p:= proc(n) p(n):=`if`(n<2, n, 2*p(n-1)+p(n-2)) end:
a:= proc(n) local k, t; t:= ithprime(n);
for k while irem(p(k), t)>0 do od; p(k)
end:
seq(a(n), n=1..23); # Alois P. Heinz, Mar 28 2014
MATHEMATICA
p[n_] := p[n] = If[n<2, n, 2*p[n-1] + p[n-2]]; a[n_] := With[{t = Prime[n]} , For[k=1, Mod[p[k], t] > 0, k++]; p[k]]; Table[a[n], {n, 1, 23}] (* Jean-François Alcover, Feb 14 2016, after Alois P. Heinz *)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 27 2014
STATUS
approved